./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_93-evilcollapse_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 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_93-evilcollapse_racefree.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 dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:46:04,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:46:04,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:46:04,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:46:04,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:46:05,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:46:05,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:46:05,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:46:05,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:46:05,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:46:05,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:46:05,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:46:05,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:46:05,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:46:05,023 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:46:05,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:46:05,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:46:05,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:46:05,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:46:05,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:46:05,024 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:46:05,024 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:46:05,024 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:46:05,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:46:05,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:46:05,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:46:05,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:46:05,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:46:05,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:46:05,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:46:05,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:46:05,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:46:05,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:46:05,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:46:05,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:46:05,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:46:05,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:46:05,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:46:05,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:46:05,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:46:05,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:46:05,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:46:05,027 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 -> dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 [2024-10-14 19:46:05,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:46:05,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:46:05,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:46:05,232 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:46:05,232 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:46:05,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-10-14 19:46:06,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:46:06,610 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:46:06,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-10-14 19:46:06,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61191b8ee/55652bf16e7c407aa0026e212f8052c7/FLAGa4f042ac4 [2024-10-14 19:46:06,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61191b8ee/55652bf16e7c407aa0026e212f8052c7 [2024-10-14 19:46:06,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:46:06,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:46:06,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:46:06,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:46:06,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:46:06,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:46:06" (1/1) ... [2024-10-14 19:46:06,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f375f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:06, skipping insertion in model container [2024-10-14 19:46:06,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:46:06" (1/1) ... [2024-10-14 19:46:07,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:46:07,329 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:07,329 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:07,330 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:07,330 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:07,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:46:07,379 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-14 19:46:07,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@52a2955f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:07, skipping insertion in model container [2024-10-14 19:46:07,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:46:07,380 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:46:07,381 INFO L158 Benchmark]: Toolchain (without parser) took 419.59ms. Allocated memory is still 186.6MB. Free memory was 156.6MB in the beginning and 140.5MB in the end (delta: 16.1MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-10-14 19:46:07,382 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 138.4MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:46:07,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.97ms. Allocated memory is still 186.6MB. Free memory was 156.4MB in the beginning and 140.5MB in the end (delta: 15.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-10-14 19:46:07,384 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.44ms. Allocated memory is still 138.4MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.97ms. Allocated memory is still 186.6MB. Free memory was 156.4MB in the beginning and 140.5MB in the end (delta: 15.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1058]: 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_93-evilcollapse_racefree.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 dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:46:08,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:46:08,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:46:08,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:46:08,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:46:08,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:46:08,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:46:08,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:46:08,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:46:08,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:46:08,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:46:08,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:46:08,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:46:08,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:46:08,984 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:46:08,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:46:08,986 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:46:08,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:46:08,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:46:08,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:46:08,986 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:46:08,988 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:46:08,988 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:46:08,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:46:08,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:46:08,988 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:46:08,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:46:08,989 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:46:08,989 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:46:08,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:46:08,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:46:08,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:46:08,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:46:08,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:46:08,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:46:08,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:46:08,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:46:08,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:46:08,990 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:46:08,990 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:46:08,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:46:08,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:46:08,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:46:08,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:46:08,992 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:46:08,992 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 -> dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 [2024-10-14 19:46:09,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:46:09,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:46:09,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:46:09,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:46:09,242 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:46:09,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-10-14 19:46:10,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:46:10,668 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:46:10,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-10-14 19:46:10,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4373fe019/d2a5685905ac4ce4884db4da4ea02d44/FLAG0f0e88cec [2024-10-14 19:46:10,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4373fe019/d2a5685905ac4ce4884db4da4ea02d44 [2024-10-14 19:46:10,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:46:10,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:46:10,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:46:10,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:46:10,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:46:10,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:46:10" (1/1) ... [2024-10-14 19:46:10,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c62804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:10, skipping insertion in model container [2024-10-14 19:46:10,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:46:10" (1/1) ... [2024-10-14 19:46:10,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:46:11,079 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:11,080 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:11,081 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:11,084 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:11,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:46:11,123 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:46:11,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:46:11,165 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:11,166 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:11,166 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:11,167 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:11,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:46:11,186 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:46:11,222 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:11,222 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:11,223 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:11,223 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-14 19:46:11,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:46:11,289 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:46:11,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11 WrapperNode [2024-10-14 19:46:11,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:46:11,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:46:11,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:46:11,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:46:11,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (1/1) ... [2024-10-14 19:46:11,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (1/1) ... [2024-10-14 19:46:11,354 INFO L138 Inliner]: procedures = 284, calls = 56, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 235 [2024-10-14 19:46:11,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:46:11,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:46:11,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:46:11,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:46:11,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (1/1) ... [2024-10-14 19:46:11,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (1/1) ... [2024-10-14 19:46:11,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (1/1) ... [2024-10-14 19:46:11,393 INFO L175 MemorySlicer]: Split 30 memory accesses to 4 slices as follows [2, 5, 21, 2]. 70 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 14 writes are split as follows [0, 0, 13, 1]. [2024-10-14 19:46:11,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (1/1) ... [2024-10-14 19:46:11,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (1/1) ... [2024-10-14 19:46:11,413 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (1/1) ... [2024-10-14 19:46:11,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (1/1) ... [2024-10-14 19:46:11,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (1/1) ... [2024-10-14 19:46:11,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (1/1) ... [2024-10-14 19:46:11,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:46:11,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:46:11,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:46:11,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:46:11,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (1/1) ... [2024-10-14 19:46:11,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:46:11,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:46:11,460 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-14 19:46:11,462 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-14 19:46:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:46:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:46:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 19:46:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 19:46:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:46:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:46:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:46:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:46:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-14 19:46:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:46:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:46:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:46:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 19:46:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 19:46:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:46:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:46:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-14 19:46:11,497 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-14 19:46:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:46:11,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:46:11,499 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:46:11,672 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:46:11,674 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:46:12,188 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:46:12,188 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:46:12,399 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:46:12,400 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-14 19:46:12,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:46:12 BoogieIcfgContainer [2024-10-14 19:46:12,400 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:46:12,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:46:12,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:46:12,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:46:12,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:46:10" (1/3) ... [2024-10-14 19:46:12,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156a4ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:46:12, skipping insertion in model container [2024-10-14 19:46:12,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:11" (2/3) ... [2024-10-14 19:46:12,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156a4ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:46:12, skipping insertion in model container [2024-10-14 19:46:12,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:46:12" (3/3) ... [2024-10-14 19:46:12,407 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_93-evilcollapse_racefree.i [2024-10-14 19:46:12,421 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:46:12,421 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-14 19:46:12,421 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:46:12,473 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-14 19:46:12,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 130 transitions, 267 flow [2024-10-14 19:46:12,558 INFO L124 PetriNetUnfolderBase]: 19/142 cut-off events. [2024-10-14 19:46:12,559 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 19:46:12,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 142 events. 19/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 531 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2024-10-14 19:46:12,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 130 transitions, 267 flow [2024-10-14 19:46:12,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 130 transitions, 267 flow [2024-10-14 19:46:12,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:46:12,583 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;@7dddaa63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:46:12,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-10-14 19:46:12,588 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:46:12,589 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-14 19:46:12,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:46:12,589 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:12,590 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-14 19:46:12,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:12,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:12,594 INFO L85 PathProgramCache]: Analyzing trace with hash 689099, now seen corresponding path program 1 times [2024-10-14 19:46:12,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:12,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814765975] [2024-10-14 19:46:12,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:12,606 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-14 19:46:12,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:12,609 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-14 19:46:12,610 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-14 19:46:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:12,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:46:12,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:12,760 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-14 19:46:12,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:12,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814765975] [2024-10-14 19:46:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814765975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:12,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:12,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:46:12,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569842276] [2024-10-14 19:46:12,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:12,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:46:12,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:46:12,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:46:12,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 130 [2024-10-14 19:46:12,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 130 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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-14 19:46:12,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:12,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 130 [2024-10-14 19:46:12,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:13,245 INFO L124 PetriNetUnfolderBase]: 126/487 cut-off events. [2024-10-14 19:46:13,245 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-10-14 19:46:13,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 487 events. 126/487 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2675 event pairs, 64 based on Foata normal form. 52/430 useless extension candidates. Maximal degree in co-relation 675. Up to 179 conditions per place. [2024-10-14 19:46:13,250 INFO L140 encePairwiseOnDemand]: 109/130 looper letters, 68 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2024-10-14 19:46:13,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 136 transitions, 423 flow [2024-10-14 19:46:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:46:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:46:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 357 transitions. [2024-10-14 19:46:13,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6865384615384615 [2024-10-14 19:46:13,282 INFO L175 Difference]: Start difference. First operand has 114 places, 130 transitions, 267 flow. Second operand 4 states and 357 transitions. [2024-10-14 19:46:13,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 136 transitions, 423 flow [2024-10-14 19:46:13,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 136 transitions, 423 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 19:46:13,296 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 247 flow [2024-10-14 19:46:13,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-10-14 19:46:13,304 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -1 predicate places. [2024-10-14 19:46:13,305 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 247 flow [2024-10-14 19:46:13,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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-14 19:46:13,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:13,306 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-14 19:46:13,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 19:46:13,506 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-14 19:46:13,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:13,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:13,507 INFO L85 PathProgramCache]: Analyzing trace with hash 689100, now seen corresponding path program 1 times [2024-10-14 19:46:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862144079] [2024-10-14 19:46:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:13,508 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-14 19:46:13,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:13,511 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-14 19:46:13,512 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-14 19:46:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:13,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:46:13,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:13,605 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-14 19:46:13,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:13,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:13,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862144079] [2024-10-14 19:46:13,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862144079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:13,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:13,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:46:13,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601526976] [2024-10-14 19:46:13,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:13,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:46:13,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:13,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:46:13,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:46:13,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 130 [2024-10-14 19:46:13,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:46:13,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:13,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 130 [2024-10-14 19:46:13,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:14,033 INFO L124 PetriNetUnfolderBase]: 128/518 cut-off events. [2024-10-14 19:46:14,034 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-10-14 19:46:14,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 518 events. 128/518 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2781 event pairs, 105 based on Foata normal form. 3/409 useless extension candidates. Maximal degree in co-relation 743. Up to 276 conditions per place. [2024-10-14 19:46:14,036 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 49 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2024-10-14 19:46:14,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 117 transitions, 369 flow [2024-10-14 19:46:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:46:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:46:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2024-10-14 19:46:14,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-10-14 19:46:14,043 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 247 flow. Second operand 4 states and 325 transitions. [2024-10-14 19:46:14,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 117 transitions, 369 flow [2024-10-14 19:46:14,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 357 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:46:14,048 INFO L231 Difference]: Finished difference. Result has 115 places, 117 transitions, 280 flow [2024-10-14 19:46:14,048 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=115, PETRI_TRANSITIONS=117} [2024-10-14 19:46:14,049 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-10-14 19:46:14,049 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 280 flow [2024-10-14 19:46:14,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:46:14,050 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:14,050 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:46:14,053 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-14 19:46:14,250 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-14 19:46:14,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:14,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash -945239132, now seen corresponding path program 1 times [2024-10-14 19:46:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388282353] [2024-10-14 19:46:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:14,252 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-14 19:46:14,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:14,254 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-14 19:46:14,255 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-14 19:46:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:14,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:46:14,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:14,344 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-14 19:46:14,347 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-14 19:46:14,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:14,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:14,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388282353] [2024-10-14 19:46:14,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388282353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:14,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:14,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:46:14,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250370082] [2024-10-14 19:46:14,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:14,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:46:14,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:14,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:46:14,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:46:14,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 130 [2024-10-14 19:46:14,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-14 19:46:14,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:14,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 130 [2024-10-14 19:46:14,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:14,580 INFO L124 PetriNetUnfolderBase]: 128/517 cut-off events. [2024-10-14 19:46:14,581 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2024-10-14 19:46:14,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 517 events. 128/517 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2774 event pairs, 105 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 810. Up to 272 conditions per place. [2024-10-14 19:46:14,583 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 47 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2024-10-14 19:46:14,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 378 flow [2024-10-14 19:46:14,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:46:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:46:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-10-14 19:46:14,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.658974358974359 [2024-10-14 19:46:14,585 INFO L175 Difference]: Start difference. First operand has 115 places, 117 transitions, 280 flow. Second operand 3 states and 257 transitions. [2024-10-14 19:46:14,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 378 flow [2024-10-14 19:46:14,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:46:14,588 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 281 flow [2024-10-14 19:46:14,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2024-10-14 19:46:14,589 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-10-14 19:46:14,589 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 281 flow [2024-10-14 19:46:14,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-14 19:46:14,589 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:14,589 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:46:14,594 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-14 19:46:14,790 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-14 19:46:14,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:14,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash -945239131, now seen corresponding path program 1 times [2024-10-14 19:46:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:14,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007954594] [2024-10-14 19:46:14,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:14,791 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-14 19:46:14,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:14,794 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-14 19:46:14,795 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-14 19:46:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:14,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:46:14,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:14,897 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-14 19:46:14,910 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-14 19:46:14,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:14,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:14,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007954594] [2024-10-14 19:46:14,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007954594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:14,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:14,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:46:14,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824916717] [2024-10-14 19:46:14,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:14,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:46:14,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:14,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:46:14,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:46:15,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 130 [2024-10-14 19:46:15,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-14 19:46:15,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:15,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 130 [2024-10-14 19:46:15,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:15,155 INFO L124 PetriNetUnfolderBase]: 128/516 cut-off events. [2024-10-14 19:46:15,155 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2024-10-14 19:46:15,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 516 events. 128/516 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2775 event pairs, 105 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 809. Up to 272 conditions per place. [2024-10-14 19:46:15,157 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 47 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-10-14 19:46:15,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 379 flow [2024-10-14 19:46:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:46:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:46:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-10-14 19:46:15,159 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.658974358974359 [2024-10-14 19:46:15,159 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 281 flow. Second operand 3 states and 257 transitions. [2024-10-14 19:46:15,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 379 flow [2024-10-14 19:46:15,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:46:15,161 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 279 flow [2024-10-14 19:46:15,161 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2024-10-14 19:46:15,162 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2024-10-14 19:46:15,162 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 279 flow [2024-10-14 19:46:15,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-14 19:46:15,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:15,162 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 19:46:15,166 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-14 19:46:15,362 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-14 19:46:15,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:15,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash 762360213, now seen corresponding path program 1 times [2024-10-14 19:46:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:15,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22059797] [2024-10-14 19:46:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:15,364 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-14 19:46:15,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:15,367 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-14 19:46:15,368 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-14 19:46:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:15,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:46:15,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:15,466 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-14 19:46:15,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:15,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:15,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22059797] [2024-10-14 19:46:15,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22059797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:15,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:15,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:46:15,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948852736] [2024-10-14 19:46:15,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:15,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:46:15,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:15,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:46:15,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:46:15,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-10-14 19:46:15,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:46:15,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:15,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-10-14 19:46:15,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:15,634 INFO L124 PetriNetUnfolderBase]: 127/538 cut-off events. [2024-10-14 19:46:15,634 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-10-14 19:46:15,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 538 events. 127/538 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2818 event pairs, 105 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 840. Up to 272 conditions per place. [2024-10-14 19:46:15,636 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 51 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2024-10-14 19:46:15,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 119 transitions, 399 flow [2024-10-14 19:46:15,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:46:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:46:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-10-14 19:46:15,637 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2024-10-14 19:46:15,637 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 279 flow. Second operand 3 states and 265 transitions. [2024-10-14 19:46:15,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 119 transitions, 399 flow [2024-10-14 19:46:15,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:46:15,640 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 284 flow [2024-10-14 19:46:15,640 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2024-10-14 19:46:15,640 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-10-14 19:46:15,640 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 284 flow [2024-10-14 19:46:15,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:46:15,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:15,641 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:46:15,645 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-14 19:46:15,843 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-14 19:46:15,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:15,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:15,845 INFO L85 PathProgramCache]: Analyzing trace with hash 762358701, now seen corresponding path program 1 times [2024-10-14 19:46:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:15,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017903112] [2024-10-14 19:46:15,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:15,845 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-14 19:46:15,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:15,847 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-14 19:46:15,847 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-14 19:46:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:15,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:46:15,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:15,937 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-14 19:46:15,963 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-14 19:46:15,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:15,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:15,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017903112] [2024-10-14 19:46:15,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017903112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:15,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:15,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:46:15,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811550379] [2024-10-14 19:46:15,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:15,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:46:15,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:15,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:46:15,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:46:16,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-10-14 19:46:16,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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-14 19:46:16,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:16,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-10-14 19:46:16,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:16,304 INFO L124 PetriNetUnfolderBase]: 127/534 cut-off events. [2024-10-14 19:46:16,305 INFO L125 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2024-10-14 19:46:16,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 534 events. 127/534 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2803 event pairs, 105 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 836. Up to 276 conditions per place. [2024-10-14 19:46:16,307 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 48 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2024-10-14 19:46:16,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 384 flow [2024-10-14 19:46:16,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:46:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:46:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2024-10-14 19:46:16,308 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6038461538461538 [2024-10-14 19:46:16,308 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 284 flow. Second operand 4 states and 314 transitions. [2024-10-14 19:46:16,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 384 flow [2024-10-14 19:46:16,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 113 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:46:16,311 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 285 flow [2024-10-14 19:46:16,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2024-10-14 19:46:16,312 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-10-14 19:46:16,312 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 285 flow [2024-10-14 19:46:16,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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-14 19:46:16,313 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:16,313 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:46:16,318 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-14 19:46:16,517 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-14 19:46:16,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:16,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash 762358700, now seen corresponding path program 1 times [2024-10-14 19:46:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:16,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473268341] [2024-10-14 19:46:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:16,519 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-14 19:46:16,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:16,520 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-14 19:46:16,521 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-14 19:46:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:16,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:46:16,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:16,601 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-14 19:46:16,622 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-14 19:46:16,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:16,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:16,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473268341] [2024-10-14 19:46:16,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473268341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:16,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:16,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:46:16,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801855935] [2024-10-14 19:46:16,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:16,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:46:16,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:16,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:46:16,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:46:16,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 130 [2024-10-14 19:46:16,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 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-14 19:46:16,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:16,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 130 [2024-10-14 19:46:16,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:16,903 INFO L124 PetriNetUnfolderBase]: 127/530 cut-off events. [2024-10-14 19:46:16,903 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-10-14 19:46:16,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 530 events. 127/530 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2788 event pairs, 105 based on Foata normal form. 2/416 useless extension candidates. Maximal degree in co-relation 840. Up to 274 conditions per place. [2024-10-14 19:46:16,905 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 45 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2024-10-14 19:46:16,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 385 flow [2024-10-14 19:46:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:46:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:46:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2024-10-14 19:46:16,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2024-10-14 19:46:16,907 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 285 flow. Second operand 5 states and 370 transitions. [2024-10-14 19:46:16,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 385 flow [2024-10-14 19:46:16,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:46:16,908 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 287 flow [2024-10-14 19:46:16,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2024-10-14 19:46:16,909 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2024-10-14 19:46:16,909 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 287 flow [2024-10-14 19:46:16,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 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-14 19:46:16,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:16,909 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:46:16,913 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-14 19:46:17,109 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-14 19:46:17,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:17,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:17,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1812674210, now seen corresponding path program 1 times [2024-10-14 19:46:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:17,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666961345] [2024-10-14 19:46:17,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:17,111 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-14 19:46:17,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:17,112 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-14 19:46:17,113 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-14 19:46:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:17,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:46:17,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:17,295 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-14 19:46:17,296 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-14 19:46:17,330 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-14 19:46:17,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:17,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:17,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666961345] [2024-10-14 19:46:17,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666961345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:17,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:17,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:46:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719431963] [2024-10-14 19:46:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:17,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:46:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:46:17,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:46:17,434 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-10-14 19:46:17,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 111 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:46:17,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:17,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-10-14 19:46:17,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:17,638 INFO L124 PetriNetUnfolderBase]: 126/500 cut-off events. [2024-10-14 19:46:17,638 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2024-10-14 19:46:17,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 500 events. 126/500 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2623 event pairs, 64 based on Foata normal form. 2/396 useless extension candidates. Maximal degree in co-relation 812. Up to 182 conditions per place. [2024-10-14 19:46:17,641 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 69 selfloop transitions, 5 changer transitions 0/132 dead transitions. [2024-10-14 19:46:17,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 477 flow [2024-10-14 19:46:17,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:46:17,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:46:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 336 transitions. [2024-10-14 19:46:17,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2024-10-14 19:46:17,642 INFO L175 Difference]: Start difference. First operand has 114 places, 111 transitions, 287 flow. Second operand 4 states and 336 transitions. [2024-10-14 19:46:17,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 477 flow [2024-10-14 19:46:17,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 132 transitions, 463 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 19:46:17,645 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 279 flow [2024-10-14 19:46:17,645 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2024-10-14 19:46:17,646 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2024-10-14 19:46:17,646 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 279 flow [2024-10-14 19:46:17,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:46:17,646 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:17,646 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:46:17,651 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-14 19:46:17,846 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-14 19:46:17,847 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:17,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:17,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1812674209, now seen corresponding path program 1 times [2024-10-14 19:46:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:17,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209034938] [2024-10-14 19:46:17,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:17,848 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-14 19:46:17,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:17,849 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-14 19:46:17,849 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-14 19:46:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:17,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 19:46:17,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:18,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:46:18,061 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-14 19:46:18,105 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-14 19:46:18,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:18,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:18,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209034938] [2024-10-14 19:46:18,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209034938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:18,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:18,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:46:18,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683076400] [2024-10-14 19:46:18,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:18,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:46:18,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:18,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:46:18,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:46:18,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-10-14 19:46:18,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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-14 19:46:18,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:18,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-10-14 19:46:18,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:18,609 INFO L124 PetriNetUnfolderBase]: 129/558 cut-off events. [2024-10-14 19:46:18,609 INFO L125 PetriNetUnfolderBase]: For 51/52 co-relation queries the response was YES. [2024-10-14 19:46:18,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 558 events. 129/558 cut-off events. For 51/52 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3042 event pairs, 106 based on Foata normal form. 2/434 useless extension candidates. Maximal degree in co-relation 856. Up to 283 conditions per place. [2024-10-14 19:46:18,612 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 55 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2024-10-14 19:46:18,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 116 transitions, 429 flow [2024-10-14 19:46:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:46:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:46:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2024-10-14 19:46:18,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6211538461538462 [2024-10-14 19:46:18,614 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 279 flow. Second operand 4 states and 323 transitions. [2024-10-14 19:46:18,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 116 transitions, 429 flow [2024-10-14 19:46:18,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:46:18,617 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 315 flow [2024-10-14 19:46:18,617 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=315, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-10-14 19:46:18,617 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -1 predicate places. [2024-10-14 19:46:18,617 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 315 flow [2024-10-14 19:46:18,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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-14 19:46:18,618 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:18,618 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:46:18,624 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-14 19:46:18,818 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-14 19:46:18,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:18,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:18,819 INFO L85 PathProgramCache]: Analyzing trace with hash -358324880, now seen corresponding path program 1 times [2024-10-14 19:46:18,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:18,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253512242] [2024-10-14 19:46:18,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:18,820 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-14 19:46:18,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:18,821 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-14 19:46:18,821 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-14 19:46:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:18,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 19:46:18,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:19,061 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-14 19:46:19,071 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-14 19:46:19,119 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-14 19:46:19,127 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-14 19:46:19,194 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 19:46:19,195 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 13 [2024-10-14 19:46:19,209 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:46:19,209 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-14 19:46:19,266 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-14 19:46:19,282 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-14 19:46:19,330 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-14 19:46:19,343 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-14 19:46:19,370 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-14 19:46:19,374 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-14 19:46:19,440 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-14 19:46:19,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:19,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:19,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253512242] [2024-10-14 19:46:19,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253512242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:19,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:19,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 19:46:19,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717140277] [2024-10-14 19:46:19,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:19,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 19:46:19,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:19,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 19:46:19,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 19:46:20,329 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 130 [2024-10-14 19:46:20,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 315 flow. Second operand has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 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-14 19:46:20,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:20,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 130 [2024-10-14 19:46:20,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:21,006 INFO L124 PetriNetUnfolderBase]: 129/557 cut-off events. [2024-10-14 19:46:21,006 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2024-10-14 19:46:21,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 557 events. 129/557 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3017 event pairs, 106 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 867. Up to 296 conditions per place. [2024-10-14 19:46:21,009 INFO L140 encePairwiseOnDemand]: 118/130 looper letters, 70 selfloop transitions, 11 changer transitions 0/129 dead transitions. [2024-10-14 19:46:21,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 129 transitions, 515 flow [2024-10-14 19:46:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:46:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:46:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 642 transitions. [2024-10-14 19:46:21,010 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4489510489510489 [2024-10-14 19:46:21,011 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 315 flow. Second operand 11 states and 642 transitions. [2024-10-14 19:46:21,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 129 transitions, 515 flow [2024-10-14 19:46:21,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:46:21,012 INFO L231 Difference]: Finished difference. Result has 127 places, 118 transitions, 371 flow [2024-10-14 19:46:21,013 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=371, PETRI_PLACES=127, PETRI_TRANSITIONS=118} [2024-10-14 19:46:21,013 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 13 predicate places. [2024-10-14 19:46:21,013 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 118 transitions, 371 flow [2024-10-14 19:46:21,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 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-14 19:46:21,014 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:21,014 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:46:21,019 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-14 19:46:21,214 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-14 19:46:21,215 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:21,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash -358324881, now seen corresponding path program 1 times [2024-10-14 19:46:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:21,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867207335] [2024-10-14 19:46:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:21,215 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-14 19:46:21,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:21,216 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-14 19:46:21,217 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-14 19:46:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:21,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 19:46:21,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:21,416 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-14 19:46:21,453 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 28 treesize of output 27 [2024-10-14 19:46:21,498 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-10-14 19:46:21,498 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-14 19:46:21,539 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 32 treesize of output 25 [2024-10-14 19:46:21,575 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 32 treesize of output 25 [2024-10-14 19:46:21,599 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 25 treesize of output 18 [2024-10-14 19:46:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:46:21,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:21,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:21,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867207335] [2024-10-14 19:46:21,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867207335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:21,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:21,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 19:46:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185287407] [2024-10-14 19:46:21,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:21,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 19:46:21,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:21,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 19:46:21,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 19:46:22,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 130 [2024-10-14 19:46:22,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 118 transitions, 371 flow. Second operand has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 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-14 19:46:22,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:22,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 130 [2024-10-14 19:46:22,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:23,476 INFO L124 PetriNetUnfolderBase]: 127/527 cut-off events. [2024-10-14 19:46:23,476 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2024-10-14 19:46:23,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 527 events. 127/527 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2873 event pairs, 64 based on Foata normal form. 2/427 useless extension candidates. Maximal degree in co-relation 876. Up to 194 conditions per place. [2024-10-14 19:46:23,479 INFO L140 encePairwiseOnDemand]: 118/130 looper letters, 77 selfloop transitions, 20 changer transitions 0/149 dead transitions. [2024-10-14 19:46:23,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 149 transitions, 637 flow [2024-10-14 19:46:23,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:46:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:46:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 713 transitions. [2024-10-14 19:46:23,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4986013986013986 [2024-10-14 19:46:23,481 INFO L175 Difference]: Start difference. First operand has 127 places, 118 transitions, 371 flow. Second operand 11 states and 713 transitions. [2024-10-14 19:46:23,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 149 transitions, 637 flow [2024-10-14 19:46:23,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 149 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:46:23,483 INFO L231 Difference]: Finished difference. Result has 140 places, 123 transitions, 459 flow [2024-10-14 19:46:23,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=459, PETRI_PLACES=140, PETRI_TRANSITIONS=123} [2024-10-14 19:46:23,484 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places. [2024-10-14 19:46:23,484 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 123 transitions, 459 flow [2024-10-14 19:46:23,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 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-14 19:46:23,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:23,484 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:46:23,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-14 19:46:23,685 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-14 19:46:23,685 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:23,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1776831246, now seen corresponding path program 1 times [2024-10-14 19:46:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:23,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594059863] [2024-10-14 19:46:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:23,686 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-14 19:46:23,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:23,688 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-14 19:46:23,689 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-14 19:46:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:23,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 19:46:23,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:23,808 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-14 19:46:23,837 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-14 19:46:23,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:23,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:23,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594059863] [2024-10-14 19:46:23,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594059863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:23,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:23,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:46:23,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902274894] [2024-10-14 19:46:23,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:23,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:46:23,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:23,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:46:23,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:46:24,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 130 [2024-10-14 19:46:24,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 123 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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-14 19:46:24,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:24,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 130 [2024-10-14 19:46:24,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:24,191 INFO L124 PetriNetUnfolderBase]: 128/545 cut-off events. [2024-10-14 19:46:24,191 INFO L125 PetriNetUnfolderBase]: For 120/121 co-relation queries the response was YES. [2024-10-14 19:46:24,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 545 events. 128/545 cut-off events. For 120/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2956 event pairs, 105 based on Foata normal form. 8/446 useless extension candidates. Maximal degree in co-relation 927. Up to 273 conditions per place. [2024-10-14 19:46:24,194 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 50 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2024-10-14 19:46:24,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 121 transitions, 577 flow [2024-10-14 19:46:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:46:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:46:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 320 transitions. [2024-10-14 19:46:24,196 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-10-14 19:46:24,196 INFO L175 Difference]: Start difference. First operand has 140 places, 123 transitions, 459 flow. Second operand 4 states and 320 transitions. [2024-10-14 19:46:24,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 121 transitions, 577 flow [2024-10-14 19:46:24,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 121 transitions, 553 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-10-14 19:46:24,198 INFO L231 Difference]: Finished difference. Result has 136 places, 121 transitions, 453 flow [2024-10-14 19:46:24,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=453, PETRI_PLACES=136, PETRI_TRANSITIONS=121} [2024-10-14 19:46:24,199 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 22 predicate places. [2024-10-14 19:46:24,199 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 121 transitions, 453 flow [2024-10-14 19:46:24,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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-14 19:46:24,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:24,200 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:46:24,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-14 19:46:24,400 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-14 19:46:24,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:24,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:24,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1776831245, now seen corresponding path program 1 times [2024-10-14 19:46:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:24,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772641589] [2024-10-14 19:46:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:24,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-14 19:46:24,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:24,407 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-14 19:46:24,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 (14)] Waiting until timeout for monitored process [2024-10-14 19:46:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:24,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:46:24,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:24,513 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-14 19:46:24,525 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-14 19:46:24,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:46:24,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:24,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772641589] [2024-10-14 19:46:24,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772641589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:46:24,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:46:24,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:46:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678602899] [2024-10-14 19:46:24,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:46:24,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:46:24,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:24,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:46:24,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:46:24,652 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-10-14 19:46:24,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 121 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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-14 19:46:24,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:24,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-10-14 19:46:24,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:24,842 INFO L124 PetriNetUnfolderBase]: 128/537 cut-off events. [2024-10-14 19:46:24,842 INFO L125 PetriNetUnfolderBase]: For 116/117 co-relation queries the response was YES. [2024-10-14 19:46:24,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 537 events. 128/537 cut-off events. For 116/117 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2891 event pairs, 105 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 904. Up to 273 conditions per place. [2024-10-14 19:46:24,844 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 52 selfloop transitions, 11 changer transitions 0/119 dead transitions. [2024-10-14 19:46:24,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 119 transitions, 575 flow [2024-10-14 19:46:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:46:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:46:24,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2024-10-14 19:46:24,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6038461538461538 [2024-10-14 19:46:24,846 INFO L175 Difference]: Start difference. First operand has 136 places, 121 transitions, 453 flow. Second operand 4 states and 314 transitions. [2024-10-14 19:46:24,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 119 transitions, 575 flow [2024-10-14 19:46:24,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 553 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:46:24,852 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 449 flow [2024-10-14 19:46:24,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2024-10-14 19:46:24,853 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 20 predicate places. [2024-10-14 19:46:24,853 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 449 flow [2024-10-14 19:46:24,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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-14 19:46:24,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:24,854 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:46:24,859 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-14 19:46:25,054 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-14 19:46:25,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:25,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:25,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1067367987, now seen corresponding path program 1 times [2024-10-14 19:46:25,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:25,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337246838] [2024-10-14 19:46:25,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:25,056 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-14 19:46:25,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:25,058 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-14 19:46:25,059 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-14 19:46:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:25,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:46:25,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:25,193 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-14 19:46:25,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:46:25,214 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-14 19:46:25,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337246838] [2024-10-14 19:46:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337246838] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:46:25,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:46:25,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-14 19:46:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863436734] [2024-10-14 19:46:25,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:46:25,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:46:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:25,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:46:25,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:46:25,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-10-14 19:46:25,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 449 flow. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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-14 19:46:25,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:25,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-10-14 19:46:25,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:25,461 INFO L124 PetriNetUnfolderBase]: 128/587 cut-off events. [2024-10-14 19:46:25,462 INFO L125 PetriNetUnfolderBase]: For 211/212 co-relation queries the response was YES. [2024-10-14 19:46:25,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 587 events. 128/587 cut-off events. For 211/212 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3017 event pairs, 105 based on Foata normal form. 6/493 useless extension candidates. Maximal degree in co-relation 967. Up to 269 conditions per place. [2024-10-14 19:46:25,477 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 65 selfloop transitions, 11 changer transitions 0/134 dead transitions. [2024-10-14 19:46:25,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 134 transitions, 713 flow [2024-10-14 19:46:25,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:46:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:46:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2024-10-14 19:46:25,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6294871794871795 [2024-10-14 19:46:25,479 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 449 flow. Second operand 6 states and 491 transitions. [2024-10-14 19:46:25,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 134 transitions, 713 flow [2024-10-14 19:46:25,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 669 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:46:25,482 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 515 flow [2024-10-14 19:46:25,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2024-10-14 19:46:25,483 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places. [2024-10-14 19:46:25,483 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 515 flow [2024-10-14 19:46:25,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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-14 19:46:25,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:25,483 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:46:25,489 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-14 19:46:25,683 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-14 19:46:25,684 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:25,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1933789751, now seen corresponding path program 1 times [2024-10-14 19:46:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:25,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337343922] [2024-10-14 19:46:25,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:25,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:46:25,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:25,686 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-14 19:46:25,686 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-14 19:46:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:25,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 19:46:25,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:25,979 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-14 19:46:26,040 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-14 19:46:26,085 INFO L349 Elim1Store]: treesize reduction 86, result has 31.2 percent of original size [2024-10-14 19:46:26,085 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 34 treesize of output 59 [2024-10-14 19:46:26,129 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-14 19:46:26,167 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-14 19:46:26,190 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-14 19:46:26,242 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 27 treesize of output 15 [2024-10-14 19:46:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:46:26,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:46:26,404 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_618) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-10-14 19:46:26,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:46:26,623 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-14 19:46:26,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:46:26,639 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-14 19:46:26,645 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-14 19:46:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-14 19:46:27,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:27,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337343922] [2024-10-14 19:46:27,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337343922] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:46:27,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:46:27,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-14 19:46:27,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279850134] [2024-10-14 19:46:27,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:46:27,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 19:46:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:27,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 19:46:27,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=162, Unknown=11, NotChecked=26, Total=240 [2024-10-14 19:46:28,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 130 [2024-10-14 19:46:28,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 515 flow. Second operand has 16 states, 16 states have (on average 30.125) internal successors, (482), 16 states have internal predecessors, (482), 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-14 19:46:28,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:28,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 130 [2024-10-14 19:46:28,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:29,805 INFO L124 PetriNetUnfolderBase]: 330/1033 cut-off events. [2024-10-14 19:46:29,805 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-10-14 19:46:29,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2047 conditions, 1033 events. 330/1033 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6062 event pairs, 292 based on Foata normal form. 6/809 useless extension candidates. Maximal degree in co-relation 1870. Up to 678 conditions per place. [2024-10-14 19:46:29,810 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 78 selfloop transitions, 23 changer transitions 0/129 dead transitions. [2024-10-14 19:46:29,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 129 transitions, 731 flow [2024-10-14 19:46:29,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:46:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:46:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 393 transitions. [2024-10-14 19:46:29,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2748251748251748 [2024-10-14 19:46:29,811 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 515 flow. Second operand 11 states and 393 transitions. [2024-10-14 19:46:29,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 129 transitions, 731 flow [2024-10-14 19:46:29,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 129 transitions, 713 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-10-14 19:46:29,814 INFO L231 Difference]: Finished difference. Result has 148 places, 123 transitions, 539 flow [2024-10-14 19:46:29,814 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=539, PETRI_PLACES=148, PETRI_TRANSITIONS=123} [2024-10-14 19:46:29,815 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 34 predicate places. [2024-10-14 19:46:29,815 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 123 transitions, 539 flow [2024-10-14 19:46:29,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 30.125) internal successors, (482), 16 states have internal predecessors, (482), 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-14 19:46:29,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:29,815 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:46:29,822 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-14 19:46:30,015 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-14 19:46:30,016 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:30,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1933789752, now seen corresponding path program 1 times [2024-10-14 19:46:30,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:30,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515607695] [2024-10-14 19:46:30,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:46:30,017 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-14 19:46:30,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:30,018 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-14 19:46:30,018 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-14 19:46:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:46:30,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-14 19:46:30,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:30,298 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-14 19:46:30,391 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-14 19:46:30,394 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-14 19:46:30,424 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-10-14 19:46:30,425 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 20 treesize of output 22 [2024-10-14 19:46:30,442 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:46:30,443 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-14 19:46:30,482 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-14 19:46:30,493 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-14 19:46:30,522 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-14 19:46:30,534 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-14 19:46:30,548 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-14 19:46:30,552 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-14 19:46:30,595 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-14 19:46:30,599 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-14 19:46:30,630 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-14 19:46:30,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:46:30,724 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_726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_727 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_726) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_727) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_726 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_726) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-10-14 19:46:30,755 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_726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_727 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_726) |c_~#c~0.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_727) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_726 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_726) |c_~#c~0.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2024-10-14 19:46:30,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:46:30,917 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-14 19:46:30,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:46:30,927 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-14 19:46:30,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:46:30,944 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-14 19:46:30,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:46:30,972 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-14 19:46:30,981 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-14 19:46:30,986 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-14 19:46:31,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:46:31,021 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-14 19:46:31,030 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-14 19:46:31,862 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-14 19:46:31,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:31,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515607695] [2024-10-14 19:46:31,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515607695] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:46:31,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:46:31,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-14 19:46:31,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545094008] [2024-10-14 19:46:31,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:46:31,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 19:46:31,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:31,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 19:46:31,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=153, Unknown=3, NotChecked=50, Total=240 [2024-10-14 19:46:32,145 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 130 [2024-10-14 19:46:32,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 123 transitions, 539 flow. Second operand has 16 states, 16 states have (on average 22.125) internal successors, (354), 16 states have internal predecessors, (354), 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-14 19:46:32,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:32,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 130 [2024-10-14 19:46:32,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:34,234 INFO L124 PetriNetUnfolderBase]: 466/1255 cut-off events. [2024-10-14 19:46:34,235 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-10-14 19:46:34,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 1255 events. 466/1255 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7458 event pairs, 422 based on Foata normal form. 6/837 useless extension candidates. Maximal degree in co-relation 2388. Up to 952 conditions per place. [2024-10-14 19:46:34,239 INFO L140 encePairwiseOnDemand]: 121/130 looper letters, 85 selfloop transitions, 23 changer transitions 0/128 dead transitions. [2024-10-14 19:46:34,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 128 transitions, 769 flow [2024-10-14 19:46:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:46:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:46:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 312 transitions. [2024-10-14 19:46:34,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.21818181818181817 [2024-10-14 19:46:34,241 INFO L175 Difference]: Start difference. First operand has 148 places, 123 transitions, 539 flow. Second operand 11 states and 312 transitions. [2024-10-14 19:46:34,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 128 transitions, 769 flow [2024-10-14 19:46:34,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 128 transitions, 678 flow, removed 13 selfloop flow, removed 13 redundant places. [2024-10-14 19:46:34,244 INFO L231 Difference]: Finished difference. Result has 146 places, 124 transitions, 502 flow [2024-10-14 19:46:34,245 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=502, PETRI_PLACES=146, PETRI_TRANSITIONS=124} [2024-10-14 19:46:34,245 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 32 predicate places. [2024-10-14 19:46:34,245 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 124 transitions, 502 flow [2024-10-14 19:46:34,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 22.125) internal successors, (354), 16 states have internal predecessors, (354), 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-14 19:46:34,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:34,245 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2024-10-14 19:46:34,254 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-14 19:46:34,446 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-14 19:46:34,446 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:34,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash 524578709, now seen corresponding path program 2 times [2024-10-14 19:46:34,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:34,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683544202] [2024-10-14 19:46:34,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:46:34,447 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-14 19:46:34,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:34,448 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-14 19:46:34,449 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-14 19:46:34,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:46:34,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:46:34,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:46:34,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:34,910 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-14 19:46:34,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:46:34,986 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-14 19:46:34,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:34,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683544202] [2024-10-14 19:46:34,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683544202] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:46:34,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:46:34,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-14 19:46:34,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129566154] [2024-10-14 19:46:34,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:46:34,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 19:46:34,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:34,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 19:46:34,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-14 19:46:34,988 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-10-14 19:46:34,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 124 transitions, 502 flow. Second operand has 12 states, 12 states have (on average 74.91666666666667) internal successors, (899), 12 states have internal predecessors, (899), 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-14 19:46:34,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:34,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-10-14 19:46:34,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:35,622 INFO L124 PetriNetUnfolderBase]: 128/695 cut-off events. [2024-10-14 19:46:35,622 INFO L125 PetriNetUnfolderBase]: For 490/491 co-relation queries the response was YES. [2024-10-14 19:46:35,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 695 events. 128/695 cut-off events. For 490/491 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2977 event pairs, 105 based on Foata normal form. 12/607 useless extension candidates. Maximal degree in co-relation 1126. Up to 269 conditions per place. [2024-10-14 19:46:35,624 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 95 selfloop transitions, 23 changer transitions 0/176 dead transitions. [2024-10-14 19:46:35,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 176 transitions, 1182 flow [2024-10-14 19:46:35,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 19:46:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-14 19:46:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 950 transitions. [2024-10-14 19:46:35,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2024-10-14 19:46:35,626 INFO L175 Difference]: Start difference. First operand has 146 places, 124 transitions, 502 flow. Second operand 12 states and 950 transitions. [2024-10-14 19:46:35,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 176 transitions, 1182 flow [2024-10-14 19:46:35,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 176 transitions, 1042 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-10-14 19:46:35,630 INFO L231 Difference]: Finished difference. Result has 155 places, 137 transitions, 686 flow [2024-10-14 19:46:35,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=686, PETRI_PLACES=155, PETRI_TRANSITIONS=137} [2024-10-14 19:46:35,631 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 41 predicate places. [2024-10-14 19:46:35,631 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 137 transitions, 686 flow [2024-10-14 19:46:35,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.91666666666667) internal successors, (899), 12 states have internal predecessors, (899), 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-14 19:46:35,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:35,631 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-10-14 19:46:35,643 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-14 19:46:35,832 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-14 19:46:35,832 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:35,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash -6493035, now seen corresponding path program 3 times [2024-10-14 19:46:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:35,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755156388] [2024-10-14 19:46:35,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:46:35,833 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-14 19:46:35,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:35,834 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-14 19:46:35,835 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-14 19:46:41,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-14 19:46:41,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:46:41,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 19:46:41,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:46:41,721 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-14 19:46:41,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:46:41,997 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-14 19:46:41,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:46:41,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755156388] [2024-10-14 19:46:41,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755156388] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:46:41,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:46:41,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-14 19:46:41,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543626055] [2024-10-14 19:46:41,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:46:41,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 19:46:41,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:46:41,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 19:46:41,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-10-14 19:46:42,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-10-14 19:46:42,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 137 transitions, 686 flow. Second operand has 24 states, 24 states have (on average 75.45833333333333) internal successors, (1811), 24 states have internal predecessors, (1811), 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-14 19:46:42,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:46:42,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-10-14 19:46:42,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:46:44,012 INFO L124 PetriNetUnfolderBase]: 128/935 cut-off events. [2024-10-14 19:46:44,012 INFO L125 PetriNetUnfolderBase]: For 1726/1727 co-relation queries the response was YES. [2024-10-14 19:46:44,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 935 events. 128/935 cut-off events. For 1726/1727 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3000 event pairs, 105 based on Foata normal form. 24/859 useless extension candidates. Maximal degree in co-relation 1524. Up to 269 conditions per place. [2024-10-14 19:46:44,015 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 155 selfloop transitions, 47 changer transitions 0/260 dead transitions. [2024-10-14 19:46:44,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 260 transitions, 2054 flow [2024-10-14 19:46:44,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 19:46:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-14 19:46:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1868 transitions. [2024-10-14 19:46:44,019 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5987179487179487 [2024-10-14 19:46:44,019 INFO L175 Difference]: Start difference. First operand has 155 places, 137 transitions, 686 flow. Second operand 24 states and 1868 transitions. [2024-10-14 19:46:44,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 260 transitions, 2054 flow [2024-10-14 19:46:44,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 260 transitions, 2042 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:46:44,027 INFO L231 Difference]: Finished difference. Result has 188 places, 162 transitions, 1218 flow [2024-10-14 19:46:44,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1218, PETRI_PLACES=188, PETRI_TRANSITIONS=162} [2024-10-14 19:46:44,029 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 74 predicate places. [2024-10-14 19:46:44,029 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 162 transitions, 1218 flow [2024-10-14 19:46:44,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 75.45833333333333) internal successors, (1811), 24 states have internal predecessors, (1811), 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-14 19:46:44,030 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:46:44,030 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1] [2024-10-14 19:46:44,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-14 19:46:44,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:46:44,231 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-14 19:46:44,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:46:44,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1350477461, now seen corresponding path program 4 times [2024-10-14 19:46:44,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:46:44,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844550804] [2024-10-14 19:46:44,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:46:44,232 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-14 19:46:44,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:46:44,233 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:46:44,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process