./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_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 ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:20:24,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:20:24,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 16:20:24,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:20:24,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:20:24,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:20:24,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:20:24,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:20:24,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:20:24,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:20:24,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:20:24,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:20:24,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:20:24,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:20:24,247 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:20:24,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:20:24,250 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:20:24,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:20:24,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:20:24,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:20:24,251 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:20:24,255 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:20:24,255 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:20:24,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:20:24,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:20:24,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:20:24,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:20:24,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:20:24,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:20:24,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:20:24,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:20:24,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:20:24,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:20:24,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:20:24,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:20:24,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:20:24,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:20:24,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:20:24,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:20:24,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:20:24,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:20:24,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:20:24,262 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 -> ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 [2024-11-12 16:20:24,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:20:24,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:20:24,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:20:24,541 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:20:24,541 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:20:24,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-11-12 16:20:26,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:20:26,313 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:20:26,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-11-12 16:20:26,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa9dd160/932af277a6444e08865ecca2b1e88a21/FLAGd611ef748 [2024-11-12 16:20:26,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa9dd160/932af277a6444e08865ecca2b1e88a21 [2024-11-12 16:20:26,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:20:26,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:20:26,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:20:26,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:20:26,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:20:26,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:20:26" (1/1) ... [2024-11-12 16:20:26,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579d0cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:26, skipping insertion in model container [2024-11-12 16:20:26,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:20:26" (1/1) ... [2024-11-12 16:20:26,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:20:26,874 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:26,876 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:26,876 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:26,878 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:26,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:20:26,966 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-12 16:20:26,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1b207ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:26, skipping insertion in model container [2024-11-12 16:20:26,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:20:26,968 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 16:20:26,970 INFO L158 Benchmark]: Toolchain (without parser) took 616.56ms. Allocated memory is still 163.6MB. Free memory was 106.5MB in the beginning and 86.4MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 16:20:26,971 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:20:26,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.65ms. Allocated memory is still 163.6MB. Free memory was 106.5MB in the beginning and 86.4MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 16:20:26,973 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.19ms. Allocated memory is still 163.6MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.65ms. Allocated memory is still 163.6MB. Free memory was 106.5MB in the beginning and 86.4MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1044]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_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 ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:20:29,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:20:29,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 16:20:29,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:20:29,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:20:29,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:20:29,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:20:29,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:20:29,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:20:29,167 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:20:29,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:20:29,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:20:29,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:20:29,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:20:29,169 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:20:29,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:20:29,170 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:20:29,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:20:29,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:20:29,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:20:29,171 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:20:29,175 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:20:29,176 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:20:29,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:20:29,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:20:29,176 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 16:20:29,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:20:29,177 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 16:20:29,177 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:20:29,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:20:29,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:20:29,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:20:29,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:20:29,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:20:29,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:20:29,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:20:29,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:20:29,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:20:29,184 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 16:20:29,184 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 16:20:29,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:20:29,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:20:29,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:20:29,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:20:29,187 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 -> ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 [2024-11-12 16:20:29,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:20:29,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:20:29,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:20:29,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:20:29,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:20:29,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-11-12 16:20:31,157 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:20:31,469 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:20:31,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-11-12 16:20:31,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb5e60b4/3cd9315551ee4f879326876235d363da/FLAGa63b8d3d1 [2024-11-12 16:20:31,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb5e60b4/3cd9315551ee4f879326876235d363da [2024-11-12 16:20:31,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:20:31,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:20:31,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:20:31,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:20:31,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:20:31,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:20:31" (1/1) ... [2024-11-12 16:20:31,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64895faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:31, skipping insertion in model container [2024-11-12 16:20:31,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:20:31" (1/1) ... [2024-11-12 16:20:31,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:20:32,082 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:32,082 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:32,083 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:32,084 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:32,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:20:32,171 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 16:20:32,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:20:32,227 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:32,227 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:32,228 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:32,228 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:32,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:20:32,267 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:20:32,307 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:32,309 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:32,309 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:32,310 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-12 16:20:32,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:20:32,417 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:20:32,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32 WrapperNode [2024-11-12 16:20:32,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:20:32,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:20:32,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:20:32,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:20:32,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (1/1) ... [2024-11-12 16:20:32,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (1/1) ... [2024-11-12 16:20:32,499 INFO L138 Inliner]: procedures = 283, calls = 120, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 264 [2024-11-12 16:20:32,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:20:32,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:20:32,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:20:32,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:20:32,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (1/1) ... [2024-11-12 16:20:32,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (1/1) ... [2024-11-12 16:20:32,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (1/1) ... [2024-11-12 16:20:32,541 INFO L175 MemorySlicer]: Split 96 memory accesses to 4 slices as follows [2, 5, 87, 2]. 91 percent of accesses are in the largest equivalence class. The 77 initializations are split as follows [2, 5, 70, 0]. The 12 writes are split as follows [0, 0, 11, 1]. [2024-11-12 16:20:32,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (1/1) ... [2024-11-12 16:20:32,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (1/1) ... [2024-11-12 16:20:32,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (1/1) ... [2024-11-12 16:20:32,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (1/1) ... [2024-11-12 16:20:32,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (1/1) ... [2024-11-12 16:20:32,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (1/1) ... [2024-11-12 16:20:32,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:20:32,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:20:32,584 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:20:32,584 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:20:32,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (1/1) ... [2024-11-12 16:20:32,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:20:32,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:20:32,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 16:20:32,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 16:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 16:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 16:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 16:20:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-12 16:20:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 16:20:32,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 16:20:32,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 16:20:32,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 16:20:32,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-12 16:20:32,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 16:20:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 16:20:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 16:20:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 16:20:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-12 16:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 16:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 16:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 16:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-12 16:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 16:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 16:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 16:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-12 16:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-12 16:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-12 16:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-12 16:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-12 16:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 16:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 16:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 16:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 16:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 16:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 16:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-12 16:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-12 16:20:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-12 16:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:20:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:20:32,683 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:20:32,884 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:20:32,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:20:33,684 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:20:33,684 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:20:35,071 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:20:35,072 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-12 16:20:35,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:20:35 BoogieIcfgContainer [2024-11-12 16:20:35,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:20:35,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:20:35,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:20:35,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:20:35,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:20:31" (1/3) ... [2024-11-12 16:20:35,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598f47c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:20:35, skipping insertion in model container [2024-11-12 16:20:35,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:32" (2/3) ... [2024-11-12 16:20:35,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598f47c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:20:35, skipping insertion in model container [2024-11-12 16:20:35,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:20:35" (3/3) ... [2024-11-12 16:20:35,081 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_91-arrayloop2_racefree.i [2024-11-12 16:20:35,100 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:20:35,100 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2024-11-12 16:20:35,100 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:20:35,201 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-12 16:20:35,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 121 transitions, 249 flow [2024-11-12 16:20:35,309 INFO L124 PetriNetUnfolderBase]: 18/133 cut-off events. [2024-11-12 16:20:35,310 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:20:35,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 133 events. 18/133 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 494 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2024-11-12 16:20:35,314 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 121 transitions, 249 flow [2024-11-12 16:20:35,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 121 transitions, 249 flow [2024-11-12 16:20:35,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:20:35,341 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;@7a0944d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:20:35,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-11-12 16:20:35,392 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:20:35,395 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-12 16:20:35,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:20:35,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:35,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:20:35,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:35,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash 698246, now seen corresponding path program 1 times [2024-11-12 16:20:35,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:35,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361176035] [2024-11-12 16:20:35,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:35,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:35,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:35,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:35,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 16:20:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:35,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:20:35,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:35,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:35,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:35,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361176035] [2024-11-12 16:20:35,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361176035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:35,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:35,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:20:35,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250219590] [2024-11-12 16:20:35,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:35,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:20:35,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:35,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:20:35,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:20:35,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2024-11-12 16:20:35,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 121 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:35,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:35,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2024-11-12 16:20:35,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:36,369 INFO L124 PetriNetUnfolderBase]: 125/457 cut-off events. [2024-11-12 16:20:36,369 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 16:20:36,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 457 events. 125/457 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2343 event pairs, 64 based on Foata normal form. 53/430 useless extension candidates. Maximal degree in co-relation 659. Up to 174 conditions per place. [2024-11-12 16:20:36,374 INFO L140 encePairwiseOnDemand]: 102/121 looper letters, 63 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2024-11-12 16:20:36,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 129 transitions, 399 flow [2024-11-12 16:20:36,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:20:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:20:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2024-11-12 16:20:36,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7066115702479339 [2024-11-12 16:20:36,390 INFO L175 Difference]: Start difference. First operand has 106 places, 121 transitions, 249 flow. Second operand 4 states and 342 transitions. [2024-11-12 16:20:36,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 129 transitions, 399 flow [2024-11-12 16:20:36,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 129 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:20:36,400 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 233 flow [2024-11-12 16:20:36,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2024-11-12 16:20:36,406 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-11-12 16:20:36,406 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 233 flow [2024-11-12 16:20:36,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:36,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:36,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:20:36,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 16:20:36,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:36,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:36,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:36,611 INFO L85 PathProgramCache]: Analyzing trace with hash 698247, now seen corresponding path program 1 times [2024-11-12 16:20:36,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:36,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908553553] [2024-11-12 16:20:36,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:36,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:36,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:36,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:36,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 16:20:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:36,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 16:20:36,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:36,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:36,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:36,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908553553] [2024-11-12 16:20:36,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908553553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:36,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:36,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:20:36,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413534676] [2024-11-12 16:20:36,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:36,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:20:36,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:36,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:20:36,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:20:37,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 121 [2024-11-12 16:20:37,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 106 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:37,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:37,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 121 [2024-11-12 16:20:37,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:37,511 INFO L124 PetriNetUnfolderBase]: 127/504 cut-off events. [2024-11-12 16:20:37,511 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-12 16:20:37,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 504 events. 127/504 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2568 event pairs, 105 based on Foata normal form. 3/421 useless extension candidates. Maximal degree in co-relation 744. Up to 271 conditions per place. [2024-11-12 16:20:37,515 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 44 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2024-11-12 16:20:37,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 345 flow [2024-11-12 16:20:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:20:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:20:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 304 transitions. [2024-11-12 16:20:37,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.628099173553719 [2024-11-12 16:20:37,518 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 233 flow. Second operand 4 states and 304 transitions. [2024-11-12 16:20:37,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 345 flow [2024-11-12 16:20:37,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 110 transitions, 333 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:20:37,522 INFO L231 Difference]: Finished difference. Result has 109 places, 110 transitions, 266 flow [2024-11-12 16:20:37,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=109, PETRI_TRANSITIONS=110} [2024-11-12 16:20:37,523 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 3 predicate places. [2024-11-12 16:20:37,523 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 110 transitions, 266 flow [2024-11-12 16:20:37,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:37,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:37,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:20:37,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 16:20:37,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:37,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:37,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash -672734423, now seen corresponding path program 1 times [2024-11-12 16:20:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:37,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402548872] [2024-11-12 16:20:37,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:37,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:37,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:37,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:37,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 16:20:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:37,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:20:37,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:37,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 16:20:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:37,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:37,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:37,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402548872] [2024-11-12 16:20:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402548872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:37,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:37,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:20:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671379291] [2024-11-12 16:20:37,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:37,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:20:37,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:37,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:20:37,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:20:38,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 121 [2024-11-12 16:20:38,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:38,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:38,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 121 [2024-11-12 16:20:38,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:38,254 INFO L124 PetriNetUnfolderBase]: 127/503 cut-off events. [2024-11-12 16:20:38,254 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-12 16:20:38,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 503 events. 127/503 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2560 event pairs, 105 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 792. Up to 267 conditions per place. [2024-11-12 16:20:38,260 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 42 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-12 16:20:38,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 354 flow [2024-11-12 16:20:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:20:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:20:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2024-11-12 16:20:38,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6611570247933884 [2024-11-12 16:20:38,264 INFO L175 Difference]: Start difference. First operand has 109 places, 110 transitions, 266 flow. Second operand 3 states and 240 transitions. [2024-11-12 16:20:38,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 354 flow [2024-11-12 16:20:38,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 109 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:20:38,269 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 267 flow [2024-11-12 16:20:38,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=109, PETRI_TRANSITIONS=109} [2024-11-12 16:20:38,270 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 3 predicate places. [2024-11-12 16:20:38,270 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 267 flow [2024-11-12 16:20:38,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:38,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:38,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:20:38,278 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 (4)] Forceful destruction successful, exit code 0 [2024-11-12 16:20:38,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:38,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:38,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:38,472 INFO L85 PathProgramCache]: Analyzing trace with hash -672734422, now seen corresponding path program 1 times [2024-11-12 16:20:38,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:38,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125704327] [2024-11-12 16:20:38,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:38,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:38,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:38,476 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:38,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 16:20:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:38,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 16:20:38,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:38,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 16:20:38,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:38,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:38,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:38,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125704327] [2024-11-12 16:20:38,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125704327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:38,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:38,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:20:38,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294125930] [2024-11-12 16:20:38,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:38,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:20:38,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:38,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:20:38,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:20:38,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 121 [2024-11-12 16:20:38,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:38,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:38,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 121 [2024-11-12 16:20:38,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:38,984 INFO L124 PetriNetUnfolderBase]: 127/502 cut-off events. [2024-11-12 16:20:38,984 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-12 16:20:38,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 502 events. 127/502 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2553 event pairs, 105 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 791. Up to 267 conditions per place. [2024-11-12 16:20:38,987 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 42 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2024-11-12 16:20:38,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 355 flow [2024-11-12 16:20:38,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:20:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:20:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2024-11-12 16:20:38,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6611570247933884 [2024-11-12 16:20:38,989 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 267 flow. Second operand 3 states and 240 transitions. [2024-11-12 16:20:38,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 355 flow [2024-11-12 16:20:38,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:20:38,993 INFO L231 Difference]: Finished difference. Result has 108 places, 108 transitions, 265 flow [2024-11-12 16:20:38,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=108, PETRI_TRANSITIONS=108} [2024-11-12 16:20:38,994 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 2 predicate places. [2024-11-12 16:20:38,994 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 108 transitions, 265 flow [2024-11-12 16:20:38,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:38,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:38,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:20:39,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 16:20:39,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:39,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:39,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:39,196 INFO L85 PathProgramCache]: Analyzing trace with hash 620070097, now seen corresponding path program 1 times [2024-11-12 16:20:39,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:39,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472439410] [2024-11-12 16:20:39,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:39,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:39,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:39,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:39,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 16:20:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:39,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 16:20:39,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:39,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 16:20:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:39,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:39,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:39,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472439410] [2024-11-12 16:20:39,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472439410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:39,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:39,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:20:39,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377163739] [2024-11-12 16:20:39,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:39,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:20:39,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:39,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:20:39,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:20:39,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2024-11-12 16:20:39,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 108 transitions, 265 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:39,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:39,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2024-11-12 16:20:39,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:39,895 INFO L124 PetriNetUnfolderBase]: 127/500 cut-off events. [2024-11-12 16:20:39,896 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-12 16:20:39,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 500 events. 127/500 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2545 event pairs, 105 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 789. Up to 269 conditions per place. [2024-11-12 16:20:39,900 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 43 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2024-11-12 16:20:39,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 106 transitions, 355 flow [2024-11-12 16:20:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:20:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:20:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2024-11-12 16:20:39,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6053719008264463 [2024-11-12 16:20:39,902 INFO L175 Difference]: Start difference. First operand has 108 places, 108 transitions, 265 flow. Second operand 4 states and 293 transitions. [2024-11-12 16:20:39,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 106 transitions, 355 flow [2024-11-12 16:20:39,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 106 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:20:39,906 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 263 flow [2024-11-12 16:20:39,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2024-11-12 16:20:39,910 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-11-12 16:20:39,910 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 263 flow [2024-11-12 16:20:39,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:39,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:39,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:20:39,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 16:20:40,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:40,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:40,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:40,112 INFO L85 PathProgramCache]: Analyzing trace with hash 620070096, now seen corresponding path program 1 times [2024-11-12 16:20:40,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:40,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998166379] [2024-11-12 16:20:40,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:40,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:40,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:40,117 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:40,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 16:20:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:40,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:20:40,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:40,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 16:20:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:40,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:40,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:40,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998166379] [2024-11-12 16:20:40,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998166379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:40,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:40,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:20:40,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295969822] [2024-11-12 16:20:40,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:40,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:20:40,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:40,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:20:40,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:20:40,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 121 [2024-11-12 16:20:40,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 106 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:40,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:40,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 121 [2024-11-12 16:20:40,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:40,745 INFO L124 PetriNetUnfolderBase]: 127/498 cut-off events. [2024-11-12 16:20:40,745 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-12 16:20:40,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 498 events. 127/498 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2534 event pairs, 105 based on Foata normal form. 1/417 useless extension candidates. Maximal degree in co-relation 790. Up to 267 conditions per place. [2024-11-12 16:20:40,749 INFO L140 encePairwiseOnDemand]: 114/121 looper letters, 40 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2024-11-12 16:20:40,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 104 transitions, 353 flow [2024-11-12 16:20:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:20:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:20:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2024-11-12 16:20:40,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5702479338842975 [2024-11-12 16:20:40,751 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 263 flow. Second operand 5 states and 345 transitions. [2024-11-12 16:20:40,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 104 transitions, 353 flow [2024-11-12 16:20:40,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 345 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:20:40,756 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 265 flow [2024-11-12 16:20:40,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2024-11-12 16:20:40,757 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 0 predicate places. [2024-11-12 16:20:40,758 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 265 flow [2024-11-12 16:20:40,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:40,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:40,759 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-12 16:20:40,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-12 16:20:40,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:40,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:40,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:40,962 INFO L85 PathProgramCache]: Analyzing trace with hash 620071633, now seen corresponding path program 1 times [2024-11-12 16:20:40,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:40,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193291772] [2024-11-12 16:20:40,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:40,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:40,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:40,966 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:40,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 16:20:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:41,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 16:20:41,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:41,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:41,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193291772] [2024-11-12 16:20:41,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193291772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:41,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:41,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:20:41,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273330864] [2024-11-12 16:20:41,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:41,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:20:41,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:20:41,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:20:41,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 121 [2024-11-12 16:20:41,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:41,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:41,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 121 [2024-11-12 16:20:41,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:41,358 INFO L124 PetriNetUnfolderBase]: 126/516 cut-off events. [2024-11-12 16:20:41,358 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-12 16:20:41,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 516 events. 126/516 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2560 event pairs, 105 based on Foata normal form. 2/428 useless extension candidates. Maximal degree in co-relation 817. Up to 267 conditions per place. [2024-11-12 16:20:41,362 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 46 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2024-11-12 16:20:41,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 377 flow [2024-11-12 16:20:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:20:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:20:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2024-11-12 16:20:41,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6831955922865014 [2024-11-12 16:20:41,364 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 265 flow. Second operand 3 states and 248 transitions. [2024-11-12 16:20:41,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 377 flow [2024-11-12 16:20:41,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 108 transitions, 357 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 16:20:41,368 INFO L231 Difference]: Finished difference. Result has 105 places, 104 transitions, 262 flow [2024-11-12 16:20:41,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=105, PETRI_TRANSITIONS=104} [2024-11-12 16:20:41,369 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, -1 predicate places. [2024-11-12 16:20:41,369 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 104 transitions, 262 flow [2024-11-12 16:20:41,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:41,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:41,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:20:41,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 16:20:41,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:41,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:41,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:41,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1113068960, now seen corresponding path program 1 times [2024-11-12 16:20:41,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:41,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678457823] [2024-11-12 16:20:41,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:41,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:41,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:41,574 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:41,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 16:20:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:42,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 16:20:42,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:42,222 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-12 16:20:42,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-12 16:20:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:42,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:42,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:42,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678457823] [2024-11-12 16:20:42,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678457823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:42,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:42,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:20:42,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760328905] [2024-11-12 16:20:42,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:42,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:20:42,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:42,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:20:42,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:20:42,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2024-11-12 16:20:42,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 104 transitions, 262 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-11-12 16:20:42,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:42,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2024-11-12 16:20:42,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:42,796 INFO L124 PetriNetUnfolderBase]: 125/470 cut-off events. [2024-11-12 16:20:42,797 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2024-11-12 16:20:42,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 470 events. 125/470 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2295 event pairs, 64 based on Foata normal form. 3/396 useless extension candidates. Maximal degree in co-relation 771. Up to 177 conditions per place. [2024-11-12 16:20:42,800 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 64 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2024-11-12 16:20:42,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 125 transitions, 442 flow [2024-11-12 16:20:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:20:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:20:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2024-11-12 16:20:42,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6673553719008265 [2024-11-12 16:20:42,803 INFO L175 Difference]: Start difference. First operand has 105 places, 104 transitions, 262 flow. Second operand 4 states and 323 transitions. [2024-11-12 16:20:42,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 125 transitions, 442 flow [2024-11-12 16:20:42,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 125 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:20:42,806 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 265 flow [2024-11-12 16:20:42,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2024-11-12 16:20:42,807 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, -1 predicate places. [2024-11-12 16:20:42,807 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 265 flow [2024-11-12 16:20:42,807 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-11-12 16:20:42,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:42,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:20:42,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-12 16:20:43,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:43,008 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:43,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:43,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1113068959, now seen corresponding path program 1 times [2024-11-12 16:20:43,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:43,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212772070] [2024-11-12 16:20:43,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:43,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:43,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:43,011 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:43,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 16:20:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:43,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 16:20:43,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:43,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 16:20:43,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 16:20:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:43,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:43,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:43,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212772070] [2024-11-12 16:20:43,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212772070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:43,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:43,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:20:43,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259573108] [2024-11-12 16:20:43,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:43,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:20:43,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:43,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:20:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:20:43,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2024-11-12 16:20:43,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:43,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:43,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2024-11-12 16:20:43,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:44,199 INFO L124 PetriNetUnfolderBase]: 128/543 cut-off events. [2024-11-12 16:20:44,199 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-12 16:20:44,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 543 events. 128/543 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2835 event pairs, 106 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 836. Up to 278 conditions per place. [2024-11-12 16:20:44,202 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 50 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2024-11-12 16:20:44,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 405 flow [2024-11-12 16:20:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:20:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:20:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2024-11-12 16:20:44,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640495867768595 [2024-11-12 16:20:44,204 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 265 flow. Second operand 4 states and 310 transitions. [2024-11-12 16:20:44,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 405 flow [2024-11-12 16:20:44,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 109 transitions, 389 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:20:44,207 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 301 flow [2024-11-12 16:20:44,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2024-11-12 16:20:44,208 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-11-12 16:20:44,208 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 301 flow [2024-11-12 16:20:44,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:44,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:44,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:20:44,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 16:20:44,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:44,409 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:44,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:44,410 INFO L85 PathProgramCache]: Analyzing trace with hash -145398612, now seen corresponding path program 1 times [2024-11-12 16:20:44,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:44,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895945441] [2024-11-12 16:20:44,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:44,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:44,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:44,412 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:44,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 16:20:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:45,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 16:20:45,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:45,102 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-11-12 16:20:45,161 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-11-12 16:20:45,229 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-12 16:20:45,230 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-11-12 16:20:45,305 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-11-12 16:20:45,363 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-11-12 16:20:45,415 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-11-12 16:20:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:45,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:45,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:45,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895945441] [2024-11-12 16:20:45,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895945441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:45,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:45,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 16:20:45,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152241420] [2024-11-12 16:20:45,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:45,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 16:20:45,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:45,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 16:20:45,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:20:46,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 121 [2024-11-12 16:20:46,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 106 transitions, 301 flow. Second operand has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:46,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:46,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 121 [2024-11-12 16:20:46,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:47,444 INFO L124 PetriNetUnfolderBase]: 126/498 cut-off events. [2024-11-12 16:20:47,444 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-11-12 16:20:47,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 498 events. 126/498 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2564 event pairs, 64 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 796. Up to 189 conditions per place. [2024-11-12 16:20:47,447 INFO L140 encePairwiseOnDemand]: 109/121 looper letters, 72 selfloop transitions, 16 changer transitions 0/138 dead transitions. [2024-11-12 16:20:47,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 138 transitions, 549 flow [2024-11-12 16:20:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 16:20:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 16:20:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 686 transitions. [2024-11-12 16:20:47,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5154019534184824 [2024-11-12 16:20:47,450 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 301 flow. Second operand 11 states and 686 transitions. [2024-11-12 16:20:47,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 138 transitions, 549 flow [2024-11-12 16:20:47,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 138 transitions, 547 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:20:47,454 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 380 flow [2024-11-12 16:20:47,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=380, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2024-11-12 16:20:47,454 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 15 predicate places. [2024-11-12 16:20:47,455 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 380 flow [2024-11-12 16:20:47,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:47,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:47,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:20:47,463 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-11-12 16:20:47,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:47,660 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:47,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash -145398611, now seen corresponding path program 1 times [2024-11-12 16:20:47,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:47,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340632166] [2024-11-12 16:20:47,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:47,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:47,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:47,663 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:47,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 16:20:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:48,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-12 16:20:48,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:48,376 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-11-12 16:20:48,389 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-11-12 16:20:48,449 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-11-12 16:20:48,459 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-11-12 16:20:48,521 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 16:20:48,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 16:20:48,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 16:20:48,611 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-11-12 16:20:48,623 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-11-12 16:20:48,675 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-11-12 16:20:48,696 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-11-12 16:20:48,726 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-11-12 16:20:48,730 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-11-12 16:20:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:48,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:48,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:48,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340632166] [2024-11-12 16:20:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340632166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:48,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:48,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 16:20:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021327195] [2024-11-12 16:20:48,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:48,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 16:20:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:48,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 16:20:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:20:49,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 121 [2024-11-12 16:20:49,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 380 flow. Second operand has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:49,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:49,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 121 [2024-11-12 16:20:49,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:50,566 INFO L124 PetriNetUnfolderBase]: 128/540 cut-off events. [2024-11-12 16:20:50,567 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-11-12 16:20:50,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 540 events. 128/540 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2788 event pairs, 106 based on Foata normal form. 1/460 useless extension candidates. Maximal degree in co-relation 868. Up to 291 conditions per place. [2024-11-12 16:20:50,569 INFO L140 encePairwiseOnDemand]: 109/121 looper letters, 70 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-11-12 16:20:50,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 595 flow [2024-11-12 16:20:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 16:20:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 16:20:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 615 transitions. [2024-11-12 16:20:50,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46205860255447034 [2024-11-12 16:20:50,572 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 380 flow. Second operand 11 states and 615 transitions. [2024-11-12 16:20:50,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 595 flow [2024-11-12 16:20:50,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 127 transitions, 575 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 16:20:50,575 INFO L231 Difference]: Finished difference. Result has 130 places, 116 transitions, 421 flow [2024-11-12 16:20:50,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=421, PETRI_PLACES=130, PETRI_TRANSITIONS=116} [2024-11-12 16:20:50,576 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 24 predicate places. [2024-11-12 16:20:50,576 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 116 transitions, 421 flow [2024-11-12 16:20:50,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:50,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:50,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:20:50,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 16:20:50,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:50,778 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:50,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash -212389002, now seen corresponding path program 1 times [2024-11-12 16:20:50,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:50,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158428114] [2024-11-12 16:20:50,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:50,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:50,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:50,782 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:50,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 16:20:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:51,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 16:20:51,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:51,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 16:20:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:51,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:51,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158428114] [2024-11-12 16:20:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158428114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:20:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912750229] [2024-11-12 16:20:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:51,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:20:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:20:51,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:20:51,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2024-11-12 16:20:51,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 116 transitions, 421 flow. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:51,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:51,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2024-11-12 16:20:51,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:51,404 INFO L124 PetriNetUnfolderBase]: 127/531 cut-off events. [2024-11-12 16:20:51,405 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-11-12 16:20:51,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 531 events. 127/531 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2733 event pairs, 105 based on Foata normal form. 8/455 useless extension candidates. Maximal degree in co-relation 843. Up to 268 conditions per place. [2024-11-12 16:20:51,408 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 45 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2024-11-12 16:20:51,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 114 transitions, 529 flow [2024-11-12 16:20:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:20:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:20:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 299 transitions. [2024-11-12 16:20:51,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6177685950413223 [2024-11-12 16:20:51,410 INFO L175 Difference]: Start difference. First operand has 130 places, 116 transitions, 421 flow. Second operand 4 states and 299 transitions. [2024-11-12 16:20:51,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 114 transitions, 529 flow [2024-11-12 16:20:51,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 114 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:20:51,414 INFO L231 Difference]: Finished difference. Result has 129 places, 114 transitions, 435 flow [2024-11-12 16:20:51,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=129, PETRI_TRANSITIONS=114} [2024-11-12 16:20:51,415 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 23 predicate places. [2024-11-12 16:20:51,415 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 114 transitions, 435 flow [2024-11-12 16:20:51,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:51,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:51,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:20:51,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 16:20:51,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:51,616 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:51,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:51,617 INFO L85 PathProgramCache]: Analyzing trace with hash -212389003, now seen corresponding path program 1 times [2024-11-12 16:20:51,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:51,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632594400] [2024-11-12 16:20:51,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:51,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:51,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:51,619 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:51,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 16:20:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:51,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 16:20:51,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:51,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 16:20:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:51,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:20:51,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:51,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632594400] [2024-11-12 16:20:51,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632594400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:20:51,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:20:51,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:20:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707184052] [2024-11-12 16:20:51,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:20:51,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:20:51,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:51,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:20:51,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:20:51,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2024-11-12 16:20:51,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 114 transitions, 435 flow. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:51,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:51,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2024-11-12 16:20:51,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:52,162 INFO L124 PetriNetUnfolderBase]: 127/523 cut-off events. [2024-11-12 16:20:52,162 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-11-12 16:20:52,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 523 events. 127/523 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2684 event pairs, 105 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 847. Up to 268 conditions per place. [2024-11-12 16:20:52,166 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 47 selfloop transitions, 11 changer transitions 0/112 dead transitions. [2024-11-12 16:20:52,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 112 transitions, 547 flow [2024-11-12 16:20:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:20:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:20:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2024-11-12 16:20:52,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6053719008264463 [2024-11-12 16:20:52,168 INFO L175 Difference]: Start difference. First operand has 129 places, 114 transitions, 435 flow. Second operand 4 states and 293 transitions. [2024-11-12 16:20:52,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 112 transitions, 547 flow [2024-11-12 16:20:52,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 112 transitions, 525 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:20:52,170 INFO L231 Difference]: Finished difference. Result has 127 places, 112 transitions, 431 flow [2024-11-12 16:20:52,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=431, PETRI_PLACES=127, PETRI_TRANSITIONS=112} [2024-11-12 16:20:52,171 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 21 predicate places. [2024-11-12 16:20:52,171 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 112 transitions, 431 flow [2024-11-12 16:20:52,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:52,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:52,172 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:20:52,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-12 16:20:52,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:52,372 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:52,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:52,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2119831121, now seen corresponding path program 1 times [2024-11-12 16:20:52,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:52,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101130403] [2024-11-12 16:20:52,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:52,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:52,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:52,375 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:52,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 16:20:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:52,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:20:52,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:52,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:20:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:52,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:20:52,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101130403] [2024-11-12 16:20:52,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101130403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:20:52,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:20:52,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-12 16:20:52,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459193549] [2024-11-12 16:20:52,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:20:52,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:20:52,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:20:52,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:20:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:20:52,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 121 [2024-11-12 16:20:52,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 112 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:52,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:20:52,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 121 [2024-11-12 16:20:52,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:20:52,993 INFO L124 PetriNetUnfolderBase]: 127/573 cut-off events. [2024-11-12 16:20:52,993 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-11-12 16:20:52,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 573 events. 127/573 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2780 event pairs, 105 based on Foata normal form. 6/499 useless extension candidates. Maximal degree in co-relation 912. Up to 264 conditions per place. [2024-11-12 16:20:52,997 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 60 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-11-12 16:20:52,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 127 transitions, 685 flow [2024-11-12 16:20:52,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:20:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:20:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2024-11-12 16:20:52,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-12 16:20:52,999 INFO L175 Difference]: Start difference. First operand has 127 places, 112 transitions, 431 flow. Second operand 6 states and 462 transitions. [2024-11-12 16:20:52,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 127 transitions, 685 flow [2024-11-12 16:20:53,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 641 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:20:53,004 INFO L231 Difference]: Finished difference. Result has 133 places, 117 transitions, 497 flow [2024-11-12 16:20:53,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=497, PETRI_PLACES=133, PETRI_TRANSITIONS=117} [2024-11-12 16:20:53,005 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 27 predicate places. [2024-11-12 16:20:53,005 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 117 transitions, 497 flow [2024-11-12 16:20:53,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:20:53,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:20:53,006 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:20:53,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-12 16:20:53,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:53,207 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:20:53,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:20:53,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1265117454, now seen corresponding path program 1 times [2024-11-12 16:20:53,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:20:53,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759416632] [2024-11-12 16:20:53,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:20:53,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:20:53,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:20:53,210 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:20:53,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 16:20:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:20:54,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 16:20:54,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:20:54,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 16:20:54,120 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-11-12 16:20:54,197 INFO L349 Elim1Store]: treesize reduction 86, result has 31.2 percent of original size [2024-11-12 16:20:54,197 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-11-12 16:20:54,260 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-11-12 16:20:54,315 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-11-12 16:20:54,344 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-11-12 16:20:54,418 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-11-12 16:20:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:20:54,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:20:54,545 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_572) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (_ bv1 1)))) is different from false [2024-11-12 16:20:54,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:20:54,891 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-11-12 16:20:54,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:20:54,910 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-11-12 16:20:54,919 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-11-12 16:21:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-12 16:21:08,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:21:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759416632] [2024-11-12 16:21:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759416632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:21:08,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:21:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-12 16:21:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32494378] [2024-11-12 16:21:08,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:21:08,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 16:21:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:21:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 16:21:08,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=208, Unknown=19, NotChecked=30, Total=306 [2024-11-12 16:21:08,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 121 [2024-11-12 16:21:08,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 117 transitions, 497 flow. Second operand has 18 states, 18 states have (on average 29.88888888888889) internal successors, (538), 18 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:21:08,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:21:08,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 121 [2024-11-12 16:21:08,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:21:10,790 INFO L124 PetriNetUnfolderBase]: 329/1030 cut-off events. [2024-11-12 16:21:10,790 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-11-12 16:21:10,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1030 events. 329/1030 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5972 event pairs, 292 based on Foata normal form. 0/805 useless extension candidates. Maximal degree in co-relation 1805. Up to 671 conditions per place. [2024-11-12 16:21:10,797 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 69 selfloop transitions, 25 changer transitions 0/122 dead transitions. [2024-11-12 16:21:10,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 122 transitions, 699 flow [2024-11-12 16:21:10,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 16:21:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 16:21:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 414 transitions. [2024-11-12 16:21:10,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28512396694214875 [2024-11-12 16:21:10,800 INFO L175 Difference]: Start difference. First operand has 133 places, 117 transitions, 497 flow. Second operand 12 states and 414 transitions. [2024-11-12 16:21:10,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 122 transitions, 699 flow [2024-11-12 16:21:10,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 122 transitions, 681 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-12 16:21:10,805 INFO L231 Difference]: Finished difference. Result has 142 places, 116 transitions, 525 flow [2024-11-12 16:21:10,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=525, PETRI_PLACES=142, PETRI_TRANSITIONS=116} [2024-11-12 16:21:10,806 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 36 predicate places. [2024-11-12 16:21:10,806 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 116 transitions, 525 flow [2024-11-12 16:21:10,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.88888888888889) internal successors, (538), 18 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:21:10,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:21:10,807 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:21:10,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-12 16:21:11,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:21:11,008 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:21:11,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:21:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1265117455, now seen corresponding path program 1 times [2024-11-12 16:21:11,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:21:11,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461556490] [2024-11-12 16:21:11,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:21:11,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:21:11,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:21:11,010 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:21:11,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-12 16:21:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:21:11,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-12 16:21:11,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:21:11,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 16:21:11,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 16:21:12,109 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-11-12 16:21:12,114 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-11-12 16:21:12,178 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-12 16:21:12,178 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 22 treesize of output 29 [2024-11-12 16:21:12,227 INFO L349 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2024-11-12 16:21:12,227 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 28 treesize of output 30 [2024-11-12 16:21:12,289 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-11-12 16:21:12,304 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 34 treesize of output 27 [2024-11-12 16:21:12,363 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 34 treesize of output 27 [2024-11-12 16:21:12,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-11-12 16:21:12,403 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 26 treesize of output 19 [2024-11-12 16:21:12,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-11-12 16:21:12,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-12 16:21:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:21:12,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:21:12,730 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_680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_681 (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_681) |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_680) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_681 (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_681) |c_~#c~0.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2024-11-12 16:21:13,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:21:13,019 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 45 treesize of output 38 [2024-11-12 16:21:13,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:21:13,034 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 60 treesize of output 55 [2024-11-12 16:21:13,047 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 23 treesize of output 11 [2024-11-12 16:21:13,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:21:13,112 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 48 treesize of output 49 [2024-11-12 16:21:13,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:21:13,123 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 40 treesize of output 41 [2024-11-12 16:21:13,128 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 16:21:13,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:21:13,143 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 38 treesize of output 41 [2024-11-12 16:21:13,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 16:21:13,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:21:13,170 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 27 treesize of output 30 [2024-11-12 16:21:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-12 16:21:14,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:21:14,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461556490] [2024-11-12 16:21:14,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461556490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:21:14,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:21:14,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-12 16:21:14,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294268435] [2024-11-12 16:21:14,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:21:14,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 16:21:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:21:14,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 16:21:14,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=225, Unknown=8, NotChecked=30, Total=306 [2024-11-12 16:21:15,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 121 [2024-11-12 16:21:15,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 116 transitions, 525 flow. Second operand has 18 states, 18 states have (on average 21.88888888888889) internal successors, (394), 18 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:21:15,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:21:15,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 121 [2024-11-12 16:21:15,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:21:19,454 INFO L124 PetriNetUnfolderBase]: 465/1264 cut-off events. [2024-11-12 16:21:19,454 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2024-11-12 16:21:19,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 1264 events. 465/1264 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7461 event pairs, 422 based on Foata normal form. 6/851 useless extension candidates. Maximal degree in co-relation 2336. Up to 945 conditions per place. [2024-11-12 16:21:19,461 INFO L140 encePairwiseOnDemand]: 111/121 looper letters, 75 selfloop transitions, 26 changer transitions 0/121 dead transitions. [2024-11-12 16:21:19,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 121 transitions, 741 flow [2024-11-12 16:21:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 16:21:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-12 16:21:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 345 transitions. [2024-11-12 16:21:19,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2193261284170375 [2024-11-12 16:21:19,464 INFO L175 Difference]: Start difference. First operand has 142 places, 116 transitions, 525 flow. Second operand 13 states and 345 transitions. [2024-11-12 16:21:19,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 121 transitions, 741 flow [2024-11-12 16:21:19,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 121 transitions, 650 flow, removed 12 selfloop flow, removed 13 redundant places. [2024-11-12 16:21:19,469 INFO L231 Difference]: Finished difference. Result has 143 places, 118 transitions, 500 flow [2024-11-12 16:21:19,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=500, PETRI_PLACES=143, PETRI_TRANSITIONS=118} [2024-11-12 16:21:19,470 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 37 predicate places. [2024-11-12 16:21:19,470 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 118 transitions, 500 flow [2024-11-12 16:21:19,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.88888888888889) internal successors, (394), 18 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:21:19,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:21:19,471 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2024-11-12 16:21:19,483 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-11-12 16:21:19,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:21:19,672 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:21:19,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:21:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1499443631, now seen corresponding path program 2 times [2024-11-12 16:21:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:21:19,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123531240] [2024-11-12 16:21:19,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:21:19,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:21:19,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:21:19,677 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:21:19,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-12 16:21:20,513 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:21:20,513 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:21:20,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:21:20,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:21:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:21:20,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:21:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:21:20,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:21:20,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123531240] [2024-11-12 16:21:20,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123531240] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:21:20,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:21:20,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-12 16:21:20,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259495335] [2024-11-12 16:21:20,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:21:20,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 16:21:20,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:21:20,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 16:21:20,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:21:20,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 121 [2024-11-12 16:21:20,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 118 transitions, 500 flow. Second operand has 12 states, 12 states have (on average 70.91666666666667) internal successors, (851), 12 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:21:20,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:21:20,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 121 [2024-11-12 16:21:20,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:21:21,867 INFO L124 PetriNetUnfolderBase]: 127/681 cut-off events. [2024-11-12 16:21:21,867 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2024-11-12 16:21:21,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 681 events. 127/681 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2729 event pairs, 105 based on Foata normal form. 12/619 useless extension candidates. Maximal degree in co-relation 1128. Up to 264 conditions per place. [2024-11-12 16:21:21,873 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 90 selfloop transitions, 23 changer transitions 0/170 dead transitions. [2024-11-12 16:21:21,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 170 transitions, 1170 flow [2024-11-12 16:21:21,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 16:21:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 16:21:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 897 transitions. [2024-11-12 16:21:21,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6177685950413223 [2024-11-12 16:21:21,877 INFO L175 Difference]: Start difference. First operand has 143 places, 118 transitions, 500 flow. Second operand 12 states and 897 transitions. [2024-11-12 16:21:21,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 170 transitions, 1170 flow [2024-11-12 16:21:21,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 170 transitions, 1026 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-11-12 16:21:21,884 INFO L231 Difference]: Finished difference. Result has 151 places, 131 transitions, 680 flow [2024-11-12 16:21:21,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=680, PETRI_PLACES=151, PETRI_TRANSITIONS=131} [2024-11-12 16:21:21,885 INFO L279 CegarLoopForPetriNet]: 106 programPoint places, 45 predicate places. [2024-11-12 16:21:21,885 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 131 transitions, 680 flow [2024-11-12 16:21:21,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 70.91666666666667) internal successors, (851), 12 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:21:21,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:21:21,886 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-11-12 16:21:21,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-12 16:21:22,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:21:22,087 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 16:21:22,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:21:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1815188591, now seen corresponding path program 3 times [2024-11-12 16:21:22,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:21:22,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670407670] [2024-11-12 16:21:22,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:21:22,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:21:22,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:21:22,096 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:21:22,098 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