./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_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-dev-4a390ef-m [2024-10-24 19:12:48,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:12:48,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 19:12:48,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:12:48,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:12:48,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:12:48,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:12:48,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:12:48,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:12:48,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:12:48,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:12:48,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:12:48,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:12:48,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:12:48,135 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:12:48,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:12:48,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:12:48,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:12:48,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:12:48,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:12:48,136 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:12:48,139 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:12:48,139 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:12:48,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:12:48,140 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:12:48,140 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:12:48,140 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:12:48,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:12:48,141 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:12:48,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:12:48,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:12:48,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:12:48,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:12:48,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:12:48,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:12:48,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:12:48,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:12:48,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:12:48,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:12:48,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:12:48,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:12:48,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:12:48,146 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-10-24 19:12:48,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:12:48,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:12:48,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:12:48,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:12:48,361 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:12:48,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-10-24 19:12:49,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:12:49,819 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:12:49,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-10-24 19:12:49,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc925fefe/deafbf393e3e43fba100811981cd4092/FLAGb98d577b5 [2024-10-24 19:12:50,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc925fefe/deafbf393e3e43fba100811981cd4092 [2024-10-24 19:12:50,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:12:50,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:12:50,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:12:50,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:12:50,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:12:50,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:12:50" (1/1) ... [2024-10-24 19:12:50,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457561b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:50, skipping insertion in model container [2024-10-24 19:12:50,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:12:50" (1/1) ... [2024-10-24 19:12:50,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:12:50,521 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:50,521 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:50,522 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:50,522 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:50,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:12:50,563 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-24 19:12:50,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6b4251b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:50, skipping insertion in model container [2024-10-24 19:12:50,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:12:50,563 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 19:12:50,566 INFO L158 Benchmark]: Toolchain (without parser) took 399.85ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 56.4MB in the beginning and 121.1MB in the end (delta: -64.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 19:12:50,566 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:12:50,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.81ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 56.2MB in the beginning and 121.1MB in the end (delta: -64.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 19:12:50,568 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.81ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 56.2MB in the beginning and 121.1MB in the end (delta: -64.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1044]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_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-dev-4a390ef-m [2024-10-24 19:12:52,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:12:52,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 19:12:52,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:12:52,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:12:52,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:12:52,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:12:52,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:12:52,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:12:52,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:12:52,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:12:52,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:12:52,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:12:52,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:12:52,266 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:12:52,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:12:52,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:12:52,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:12:52,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:12:52,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:12:52,269 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:12:52,269 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:12:52,270 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:12:52,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:12:52,270 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:12:52,270 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 19:12:52,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:12:52,270 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 19:12:52,270 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:12:52,270 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:12:52,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:12:52,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:12:52,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:12:52,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:12:52,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:12:52,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:12:52,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:12:52,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:12:52,272 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 19:12:52,272 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 19:12:52,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:12:52,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:12:52,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:12:52,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:12:52,274 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 19:12:52,275 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-10-24 19:12:52,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:12:52,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:12:52,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:12:52,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:12:52,526 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:12:52,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-10-24 19:12:53,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:12:54,040 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:12:54,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-10-24 19:12:54,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6af9324a/2be17f1b54b54e5ab45087d1159933ed/FLAG3302853a6 [2024-10-24 19:12:54,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6af9324a/2be17f1b54b54e5ab45087d1159933ed [2024-10-24 19:12:54,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:12:54,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:12:54,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:12:54,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:12:54,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:12:54,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762c1c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54, skipping insertion in model container [2024-10-24 19:12:54,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:12:54,461 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:54,462 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:54,462 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:54,463 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:54,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:12:54,510 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 19:12:54,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:12:54,539 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:54,540 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:54,540 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:54,540 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:54,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:12:54,552 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:12:54,578 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:54,578 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:54,578 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:54,579 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:54,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:12:54,646 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:12:54,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54 WrapperNode [2024-10-24 19:12:54,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:12:54,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:12:54,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:12:54,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:12:54,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,692 INFO L138 Inliner]: procedures = 282, calls = 50, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 196 [2024-10-24 19:12:54,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:12:54,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:12:54,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:12:54,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:12:54,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,727 INFO L175 MemorySlicer]: Split 28 memory accesses to 4 slices as follows [2, 5, 19, 2]. 68 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 14 writes are split as follows [0, 0, 13, 1]. [2024-10-24 19:12:54,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:12:54,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:12:54,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:12:54,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:12:54,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (1/1) ... [2024-10-24 19:12:54,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:12:54,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:12:54,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 19:12:54,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 19:12:54,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 19:12:54,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 19:12:54,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 19:12:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 19:12:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 19:12:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 19:12:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 19:12:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 19:12:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 19:12:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 19:12:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 19:12:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 19:12:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 19:12:54,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 19:12:54,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 19:12:54,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 19:12:54,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 19:12:54,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 19:12:54,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 19:12:54,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 19:12:54,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 19:12:54,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 19:12:54,842 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 19:12:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 19:12:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 19:12:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:12:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 19:12:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 19:12:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 19:12:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 19:12:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-24 19:12:54,844 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-24 19:12:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:12:54,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:12:54,846 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:12:55,037 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:12:55,039 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:12:55,515 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:12:55,515 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:12:55,703 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:12:55,703 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-24 19:12:55,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:12:55 BoogieIcfgContainer [2024-10-24 19:12:55,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:12:55,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:12:55,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:12:55,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:12:55,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:12:54" (1/3) ... [2024-10-24 19:12:55,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527e00dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:12:55, skipping insertion in model container [2024-10-24 19:12:55,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:54" (2/3) ... [2024-10-24 19:12:55,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527e00dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:12:55, skipping insertion in model container [2024-10-24 19:12:55,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:12:55" (3/3) ... [2024-10-24 19:12:55,709 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_91-arrayloop2_racefree.i [2024-10-24 19:12:55,721 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:12:55,721 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2024-10-24 19:12:55,721 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:12:55,786 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-24 19:12:55,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 121 transitions, 249 flow [2024-10-24 19:12:55,853 INFO L124 PetriNetUnfolderBase]: 18/133 cut-off events. [2024-10-24 19:12:55,854 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 19:12:55,857 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-10-24 19:12:55,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 121 transitions, 249 flow [2024-10-24 19:12:55,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 121 transitions, 249 flow [2024-10-24 19:12:55,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:12:55,875 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;@4abe703c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:12:55,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-10-24 19:12:55,880 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:12:55,881 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-24 19:12:55,881 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:12:55,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:12:55,881 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-24 19:12:55,882 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-10-24 19:12:55,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:12:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash 563198, now seen corresponding path program 1 times [2024-10-24 19:12:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:12:55,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226148687] [2024-10-24 19:12:55,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:12:55,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:55,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:12:55,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:12:55,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 19:12:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:12:55,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:12:56,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:12:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:12:56,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:12:56,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:12:56,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226148687] [2024-10-24 19:12:56,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226148687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:12:56,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:12:56,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:12:56,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712090429] [2024-10-24 19:12:56,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:12:56,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:12:56,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:12:56,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:12:56,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:12:56,239 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2024-10-24 19:12:56,242 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-10-24 19:12:56,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:12:56,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2024-10-24 19:12:56,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:12:56,536 INFO L124 PetriNetUnfolderBase]: 125/457 cut-off events. [2024-10-24 19:12:56,536 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 19:12:56,537 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-10-24 19:12:56,540 INFO L140 encePairwiseOnDemand]: 102/121 looper letters, 63 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2024-10-24 19:12:56,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 129 transitions, 399 flow [2024-10-24 19:12:56,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:12:56,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:12:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2024-10-24 19:12:56,562 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7066115702479339 [2024-10-24 19:12:56,566 INFO L175 Difference]: Start difference. First operand has 106 places, 121 transitions, 249 flow. Second operand 4 states and 342 transitions. [2024-10-24 19:12:56,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 129 transitions, 399 flow [2024-10-24 19:12:56,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 129 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 19:12:56,591 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 233 flow [2024-10-24 19:12:56,593 INFO L260 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-10-24 19:12:56,599 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-10-24 19:12:56,600 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 233 flow [2024-10-24 19:12:56,600 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-10-24 19:12:56,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:12:56,600 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-24 19:12:56,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 19:12:56,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:56,801 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-10-24 19:12:56,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:12:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash 563199, now seen corresponding path program 1 times [2024-10-24 19:12:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:12:56,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360909571] [2024-10-24 19:12:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:12:56,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:56,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:12:56,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:12:56,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 19:12:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:12:56,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 19:12:56,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:12:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:12:56,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:12:56,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:12:56,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360909571] [2024-10-24 19:12:56,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360909571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:12:56,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:12:56,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:12:56,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864317673] [2024-10-24 19:12:56,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:12:56,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:12:56,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:12:56,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:12:56,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:12:57,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 121 [2024-10-24 19:12:57,144 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-10-24 19:12:57,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:12:57,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 121 [2024-10-24 19:12:57,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:12:57,448 INFO L124 PetriNetUnfolderBase]: 127/504 cut-off events. [2024-10-24 19:12:57,448 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-24 19:12:57,450 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-10-24 19:12:57,452 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 44 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2024-10-24 19:12:57,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 345 flow [2024-10-24 19:12:57,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:12:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:12:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 304 transitions. [2024-10-24 19:12:57,456 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.628099173553719 [2024-10-24 19:12:57,456 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 233 flow. Second operand 4 states and 304 transitions. [2024-10-24 19:12:57,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 345 flow [2024-10-24 19:12:57,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 110 transitions, 333 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:12:57,461 INFO L231 Difference]: Finished difference. Result has 109 places, 110 transitions, 266 flow [2024-10-24 19:12:57,461 INFO L260 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-10-24 19:12:57,462 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 3 predicate places. [2024-10-24 19:12:57,462 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 110 transitions, 266 flow [2024-10-24 19:12:57,462 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-10-24 19:12:57,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:12:57,462 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 19:12:57,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 19:12:57,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:57,663 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-10-24 19:12:57,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:12:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash -401117143, now seen corresponding path program 1 times [2024-10-24 19:12:57,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:12:57,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250902537] [2024-10-24 19:12:57,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:12:57,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:57,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:12:57,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:12:57,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 19:12:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:12:57,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:12:57,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:12:57,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 19:12:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:12:57,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:12:57,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:12:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250902537] [2024-10-24 19:12:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250902537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:12:57,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:12:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:12:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071530026] [2024-10-24 19:12:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:12:57,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:12:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:12:57,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:12:57,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:12:57,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 121 [2024-10-24 19:12:57,836 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-10-24 19:12:57,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:12:57,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 121 [2024-10-24 19:12:57,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:12:57,986 INFO L124 PetriNetUnfolderBase]: 127/503 cut-off events. [2024-10-24 19:12:57,987 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-24 19:12:57,988 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-10-24 19:12:57,989 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 42 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-10-24 19:12:57,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 354 flow [2024-10-24 19:12:57,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:12:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:12:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2024-10-24 19:12:57,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6611570247933884 [2024-10-24 19:12:57,992 INFO L175 Difference]: Start difference. First operand has 109 places, 110 transitions, 266 flow. Second operand 3 states and 240 transitions. [2024-10-24 19:12:57,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 354 flow [2024-10-24 19:12:57,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 109 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:12:57,995 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 267 flow [2024-10-24 19:12:57,997 INFO L260 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-10-24 19:12:57,997 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 3 predicate places. [2024-10-24 19:12:57,998 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 267 flow [2024-10-24 19:12:57,998 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-10-24 19:12:57,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:12:57,998 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 19:12:58,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 19:12:58,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:58,199 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-10-24 19:12:58,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:12:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash -401117142, now seen corresponding path program 1 times [2024-10-24 19:12:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:12:58,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151948850] [2024-10-24 19:12:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:12:58,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:58,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:12:58,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:12:58,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 19:12:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:12:58,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 19:12:58,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:12:58,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 19:12:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:12:58,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:12:58,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:12:58,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151948850] [2024-10-24 19:12:58,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151948850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:12:58,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:12:58,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:12:58,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415201666] [2024-10-24 19:12:58,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:12:58,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:12:58,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:12:58,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:12:58,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:12:58,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 121 [2024-10-24 19:12:58,374 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-10-24 19:12:58,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:12:58,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 121 [2024-10-24 19:12:58,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:12:58,514 INFO L124 PetriNetUnfolderBase]: 127/502 cut-off events. [2024-10-24 19:12:58,516 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-24 19:12:58,517 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-10-24 19:12:58,520 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 42 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2024-10-24 19:12:58,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 355 flow [2024-10-24 19:12:58,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:12:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:12:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2024-10-24 19:12:58,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6611570247933884 [2024-10-24 19:12:58,522 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 267 flow. Second operand 3 states and 240 transitions. [2024-10-24 19:12:58,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 355 flow [2024-10-24 19:12:58,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:12:58,527 INFO L231 Difference]: Finished difference. Result has 108 places, 108 transitions, 265 flow [2024-10-24 19:12:58,527 INFO L260 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-10-24 19:12:58,528 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 2 predicate places. [2024-10-24 19:12:58,528 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 108 transitions, 265 flow [2024-10-24 19:12:58,528 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-10-24 19:12:58,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:12:58,528 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:12:58,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 19:12:58,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:58,729 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-10-24 19:12:58,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:12:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash 450271049, now seen corresponding path program 1 times [2024-10-24 19:12:58,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:12:58,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232138199] [2024-10-24 19:12:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:12:58,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:58,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:12:58,731 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:12:58,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 19:12:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:12:58,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 19:12:58,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:12:58,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 19:12:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:12:58,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:12:58,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:12:58,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232138199] [2024-10-24 19:12:58,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232138199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:12:58,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:12:58,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:12:58,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646934435] [2024-10-24 19:12:58,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:12:58,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:12:58,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:12:58,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:12:58,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:12:59,003 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2024-10-24 19:12:59,004 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-10-24 19:12:59,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:12:59,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2024-10-24 19:12:59,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:12:59,201 INFO L124 PetriNetUnfolderBase]: 127/500 cut-off events. [2024-10-24 19:12:59,201 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-24 19:12:59,202 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-10-24 19:12:59,204 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 43 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2024-10-24 19:12:59,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 106 transitions, 355 flow [2024-10-24 19:12:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:12:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:12:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2024-10-24 19:12:59,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6053719008264463 [2024-10-24 19:12:59,205 INFO L175 Difference]: Start difference. First operand has 108 places, 108 transitions, 265 flow. Second operand 4 states and 293 transitions. [2024-10-24 19:12:59,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 106 transitions, 355 flow [2024-10-24 19:12:59,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 106 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:12:59,207 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 263 flow [2024-10-24 19:12:59,207 INFO L260 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-10-24 19:12:59,208 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-10-24 19:12:59,208 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 263 flow [2024-10-24 19:12:59,208 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-10-24 19:12:59,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:12:59,209 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:12:59,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 19:12:59,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:59,409 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-10-24 19:12:59,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:12:59,410 INFO L85 PathProgramCache]: Analyzing trace with hash 450271048, now seen corresponding path program 1 times [2024-10-24 19:12:59,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:12:59,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258683727] [2024-10-24 19:12:59,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:12:59,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-10-24 19:12:59,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:12:59,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:12:59,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 19:12:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:12:59,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:12:59,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:12:59,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 19:12:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:12:59,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:12:59,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:12:59,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258683727] [2024-10-24 19:12:59,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258683727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:12:59,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:12:59,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:12:59,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681633060] [2024-10-24 19:12:59,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:12:59,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:12:59,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:12:59,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:12:59,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:12:59,593 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 121 [2024-10-24 19:12:59,593 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-10-24 19:12:59,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:12:59,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 121 [2024-10-24 19:12:59,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:12:59,769 INFO L124 PetriNetUnfolderBase]: 127/498 cut-off events. [2024-10-24 19:12:59,769 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-24 19:12:59,770 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-10-24 19:12:59,771 INFO L140 encePairwiseOnDemand]: 114/121 looper letters, 40 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2024-10-24 19:12:59,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 104 transitions, 353 flow [2024-10-24 19:12:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:12:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:12:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2024-10-24 19:12:59,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5702479338842975 [2024-10-24 19:12:59,773 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 263 flow. Second operand 5 states and 345 transitions. [2024-10-24 19:12:59,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 104 transitions, 353 flow [2024-10-24 19:12:59,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 345 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:12:59,776 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 265 flow [2024-10-24 19:12:59,777 INFO L260 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-10-24 19:12:59,778 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 0 predicate places. [2024-10-24 19:12:59,779 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 265 flow [2024-10-24 19:12:59,779 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-10-24 19:12:59,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:12:59,779 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 19:12:59,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 19:12:59,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:59,980 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-10-24 19:12:59,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:12:59,981 INFO L85 PathProgramCache]: Analyzing trace with hash 450272585, now seen corresponding path program 1 times [2024-10-24 19:12:59,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:12:59,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586186722] [2024-10-24 19:12:59,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:12:59,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:59,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:12:59,987 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:12:59,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 19:13:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:00,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:13:00,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:00,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:00,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:00,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586186722] [2024-10-24 19:13:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586186722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:00,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:13:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944695599] [2024-10-24 19:13:00,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:00,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:13:00,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:00,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:13:00,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:13:00,062 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 121 [2024-10-24 19:13:00,062 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-10-24 19:13:00,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:00,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 121 [2024-10-24 19:13:00,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:00,210 INFO L124 PetriNetUnfolderBase]: 126/516 cut-off events. [2024-10-24 19:13:00,211 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-24 19:13:00,211 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-10-24 19:13:00,213 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 46 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2024-10-24 19:13:00,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 377 flow [2024-10-24 19:13:00,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:13:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:13:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2024-10-24 19:13:00,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6831955922865014 [2024-10-24 19:13:00,214 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 265 flow. Second operand 3 states and 248 transitions. [2024-10-24 19:13:00,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 377 flow [2024-10-24 19:13:00,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 108 transitions, 357 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:13:00,215 INFO L231 Difference]: Finished difference. Result has 105 places, 104 transitions, 262 flow [2024-10-24 19:13:00,216 INFO L260 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-10-24 19:13:00,216 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -1 predicate places. [2024-10-24 19:13:00,216 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 104 transitions, 262 flow [2024-10-24 19:13:00,216 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-10-24 19:13:00,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:00,217 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:00,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 19:13:00,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:00,420 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-10-24 19:13:00,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:00,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1081201192, now seen corresponding path program 1 times [2024-10-24 19:13:00,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:00,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929677449] [2024-10-24 19:13:00,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:00,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:00,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:00,423 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:00,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 (9)] Waiting until timeout for monitored process [2024-10-24 19:13:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:00,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 19:13:00,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:00,579 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 19:13:00,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-24 19:13:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:00,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:00,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:00,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929677449] [2024-10-24 19:13:00,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929677449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:00,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:00,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:13:00,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014056039] [2024-10-24 19:13:00,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:00,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:13:00,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:00,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:13:00,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:13:00,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2024-10-24 19:13:00,721 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-10-24 19:13:00,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:00,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2024-10-24 19:13:00,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:00,929 INFO L124 PetriNetUnfolderBase]: 125/470 cut-off events. [2024-10-24 19:13:00,929 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2024-10-24 19:13:00,929 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-10-24 19:13:00,931 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 64 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2024-10-24 19:13:00,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 125 transitions, 442 flow [2024-10-24 19:13:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:13:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:13:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2024-10-24 19:13:00,932 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6673553719008265 [2024-10-24 19:13:00,932 INFO L175 Difference]: Start difference. First operand has 105 places, 104 transitions, 262 flow. Second operand 4 states and 323 transitions. [2024-10-24 19:13:00,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 125 transitions, 442 flow [2024-10-24 19:13:00,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 125 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:13:00,934 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 265 flow [2024-10-24 19:13:00,934 INFO L260 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-10-24 19:13:00,934 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -1 predicate places. [2024-10-24 19:13:00,934 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 265 flow [2024-10-24 19:13:00,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:13:00,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:00,935 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:00,942 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-10-24 19:13:01,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:01,135 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-10-24 19:13:01,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:01,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1081201191, now seen corresponding path program 1 times [2024-10-24 19:13:01,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:01,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72026127] [2024-10-24 19:13:01,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:01,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:01,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:01,139 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:01,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 19:13:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:01,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 19:13:01,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:01,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 19:13:01,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 19:13:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:01,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:01,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:01,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72026127] [2024-10-24 19:13:01,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72026127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:01,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:01,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:13:01,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810193451] [2024-10-24 19:13:01,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:01,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:13:01,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:01,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:13:01,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:13:01,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2024-10-24 19:13:01,623 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-10-24 19:13:01,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:01,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2024-10-24 19:13:01,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:01,904 INFO L124 PetriNetUnfolderBase]: 128/543 cut-off events. [2024-10-24 19:13:01,904 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-10-24 19:13:01,905 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-10-24 19:13:01,909 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 50 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2024-10-24 19:13:01,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 405 flow [2024-10-24 19:13:01,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:13:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:13:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2024-10-24 19:13:01,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.640495867768595 [2024-10-24 19:13:01,910 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 265 flow. Second operand 4 states and 310 transitions. [2024-10-24 19:13:01,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 405 flow [2024-10-24 19:13:01,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 109 transitions, 389 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:13:01,913 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 301 flow [2024-10-24 19:13:01,913 INFO L260 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-10-24 19:13:01,914 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-10-24 19:13:01,914 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 301 flow [2024-10-24 19:13:01,914 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-10-24 19:13:01,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:01,914 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:01,920 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 (10)] Forceful destruction successful, exit code 0 [2024-10-24 19:13:02,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:02,115 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-10-24 19:13:02,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:02,115 INFO L85 PathProgramCache]: Analyzing trace with hash 842502060, now seen corresponding path program 1 times [2024-10-24 19:13:02,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:02,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107019968] [2024-10-24 19:13:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:02,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:02,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:02,117 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:02,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 (11)] Waiting until timeout for monitored process [2024-10-24 19:13:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:02,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 19:13:02,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:02,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 19:13:02,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2024-10-24 19:13:02,395 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-10-24 19:13:02,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2024-10-24 19:13:02,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-24 19:13:02,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-24 19:13:02,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 19:13:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:02,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:02,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107019968] [2024-10-24 19:13:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107019968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:02,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:02,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 19:13:02,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565865533] [2024-10-24 19:13:02,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:02,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:13:02,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:02,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:13:02,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:13:03,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 121 [2024-10-24 19:13:03,353 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-10-24 19:13:03,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:03,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 121 [2024-10-24 19:13:03,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:03,950 INFO L124 PetriNetUnfolderBase]: 126/498 cut-off events. [2024-10-24 19:13:03,951 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-10-24 19:13:03,951 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-10-24 19:13:03,953 INFO L140 encePairwiseOnDemand]: 109/121 looper letters, 72 selfloop transitions, 16 changer transitions 0/138 dead transitions. [2024-10-24 19:13:03,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 138 transitions, 549 flow [2024-10-24 19:13:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:13:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 19:13:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 686 transitions. [2024-10-24 19:13:03,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5154019534184824 [2024-10-24 19:13:03,955 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 301 flow. Second operand 11 states and 686 transitions. [2024-10-24 19:13:03,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 138 transitions, 549 flow [2024-10-24 19:13:03,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 138 transitions, 547 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:13:03,957 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 380 flow [2024-10-24 19:13:03,957 INFO L260 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-10-24 19:13:03,958 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 15 predicate places. [2024-10-24 19:13:03,958 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 380 flow [2024-10-24 19:13:03,958 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-10-24 19:13:03,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:03,958 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:03,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 19:13:04,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:04,163 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-10-24 19:13:04,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash 842502061, now seen corresponding path program 1 times [2024-10-24 19:13:04,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:04,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479222620] [2024-10-24 19:13:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:04,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:04,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:04,165 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:04,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 19:13:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:04,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 19:13:04,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:04,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 19:13:04,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 19:13:04,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 19:13:04,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-24 19:13:04,490 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 19:13:04,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-24 19:13:04,506 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 19:13:04,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 19:13:04,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-24 19:13:04,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 19:13:04,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-24 19:13:04,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 19:13:04,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-24 19:13:04,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 19:13:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:04,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:04,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:04,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479222620] [2024-10-24 19:13:04,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479222620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:04,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:04,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 19:13:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338951181] [2024-10-24 19:13:04,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:04,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:13:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:04,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:13:04,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:13:05,456 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 121 [2024-10-24 19:13:05,457 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-10-24 19:13:05,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:05,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 121 [2024-10-24 19:13:05,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:06,062 INFO L124 PetriNetUnfolderBase]: 128/540 cut-off events. [2024-10-24 19:13:06,063 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-10-24 19:13:06,063 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-10-24 19:13:06,065 INFO L140 encePairwiseOnDemand]: 109/121 looper letters, 70 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-10-24 19:13:06,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 595 flow [2024-10-24 19:13:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:13:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 19:13:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 615 transitions. [2024-10-24 19:13:06,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46205860255447034 [2024-10-24 19:13:06,067 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 380 flow. Second operand 11 states and 615 transitions. [2024-10-24 19:13:06,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 595 flow [2024-10-24 19:13:06,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 127 transitions, 575 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 19:13:06,069 INFO L231 Difference]: Finished difference. Result has 130 places, 116 transitions, 421 flow [2024-10-24 19:13:06,069 INFO L260 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-10-24 19:13:06,070 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 24 predicate places. [2024-10-24 19:13:06,070 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 116 transitions, 421 flow [2024-10-24 19:13:06,070 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-10-24 19:13:06,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:06,070 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:06,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 19:13:06,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:06,271 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-10-24 19:13:06,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:06,271 INFO L85 PathProgramCache]: Analyzing trace with hash 347760622, now seen corresponding path program 1 times [2024-10-24 19:13:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:06,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115803787] [2024-10-24 19:13:06,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:06,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:06,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:06,273 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:06,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 19:13:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:06,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 19:13:06,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:06,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 19:13:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:06,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:06,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:06,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115803787] [2024-10-24 19:13:06,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115803787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:06,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:06,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:13:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589734585] [2024-10-24 19:13:06,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:06,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:13:06,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:06,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:13:06,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:13:06,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2024-10-24 19:13:06,570 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-10-24 19:13:06,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:06,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2024-10-24 19:13:06,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:06,738 INFO L124 PetriNetUnfolderBase]: 127/531 cut-off events. [2024-10-24 19:13:06,738 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-10-24 19:13:06,739 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-10-24 19:13:06,741 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 45 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2024-10-24 19:13:06,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 114 transitions, 529 flow [2024-10-24 19:13:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:13:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:13:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 299 transitions. [2024-10-24 19:13:06,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6177685950413223 [2024-10-24 19:13:06,742 INFO L175 Difference]: Start difference. First operand has 130 places, 116 transitions, 421 flow. Second operand 4 states and 299 transitions. [2024-10-24 19:13:06,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 114 transitions, 529 flow [2024-10-24 19:13:06,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 114 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:13:06,745 INFO L231 Difference]: Finished difference. Result has 129 places, 114 transitions, 435 flow [2024-10-24 19:13:06,745 INFO L260 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-10-24 19:13:06,745 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 23 predicate places. [2024-10-24 19:13:06,745 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 114 transitions, 435 flow [2024-10-24 19:13:06,745 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-10-24 19:13:06,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:06,745 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:06,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-24 19:13:06,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:06,948 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-10-24 19:13:06,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:06,948 INFO L85 PathProgramCache]: Analyzing trace with hash 347760621, now seen corresponding path program 1 times [2024-10-24 19:13:06,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:06,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821523502] [2024-10-24 19:13:06,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:06,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:06,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:06,949 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:06,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 19:13:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:07,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 19:13:07,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:07,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 19:13:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:07,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:07,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:07,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821523502] [2024-10-24 19:13:07,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821523502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:07,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:07,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:13:07,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930801804] [2024-10-24 19:13:07,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:07,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:13:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:07,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:13:07,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:13:07,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2024-10-24 19:13:07,192 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-10-24 19:13:07,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:07,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2024-10-24 19:13:07,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:07,364 INFO L124 PetriNetUnfolderBase]: 127/523 cut-off events. [2024-10-24 19:13:07,365 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-10-24 19:13:07,365 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-10-24 19:13:07,367 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 47 selfloop transitions, 11 changer transitions 0/112 dead transitions. [2024-10-24 19:13:07,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 112 transitions, 547 flow [2024-10-24 19:13:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:13:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:13:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2024-10-24 19:13:07,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6053719008264463 [2024-10-24 19:13:07,369 INFO L175 Difference]: Start difference. First operand has 129 places, 114 transitions, 435 flow. Second operand 4 states and 293 transitions. [2024-10-24 19:13:07,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 112 transitions, 547 flow [2024-10-24 19:13:07,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 112 transitions, 525 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:13:07,372 INFO L231 Difference]: Finished difference. Result has 127 places, 112 transitions, 431 flow [2024-10-24 19:13:07,374 INFO L260 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-10-24 19:13:07,375 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 21 predicate places. [2024-10-24 19:13:07,375 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 112 transitions, 431 flow [2024-10-24 19:13:07,375 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-10-24 19:13:07,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:07,375 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:07,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-24 19:13:07,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:07,576 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-10-24 19:13:07,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:07,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1194092975, now seen corresponding path program 1 times [2024-10-24 19:13:07,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:07,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489660600] [2024-10-24 19:13:07,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:07,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:07,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:07,580 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:07,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 19:13:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:07,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:13:07,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:07,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:13:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:07,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:07,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489660600] [2024-10-24 19:13:07,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489660600] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:13:07,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:13:07,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-24 19:13:07,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940216034] [2024-10-24 19:13:07,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:13:07,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:13:07,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:07,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:13:07,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:13:07,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 121 [2024-10-24 19:13:07,755 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-10-24 19:13:07,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:07,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 121 [2024-10-24 19:13:07,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:07,990 INFO L124 PetriNetUnfolderBase]: 127/573 cut-off events. [2024-10-24 19:13:07,991 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-10-24 19:13:07,992 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-10-24 19:13:07,993 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 60 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-10-24 19:13:07,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 127 transitions, 685 flow [2024-10-24 19:13:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:13:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:13:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2024-10-24 19:13:07,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-10-24 19:13:07,995 INFO L175 Difference]: Start difference. First operand has 127 places, 112 transitions, 431 flow. Second operand 6 states and 462 transitions. [2024-10-24 19:13:07,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 127 transitions, 685 flow [2024-10-24 19:13:07,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 641 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:13:07,998 INFO L231 Difference]: Finished difference. Result has 133 places, 117 transitions, 497 flow [2024-10-24 19:13:07,999 INFO L260 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-10-24 19:13:07,999 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 27 predicate places. [2024-10-24 19:13:07,999 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 117 transitions, 497 flow [2024-10-24 19:13:07,999 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-10-24 19:13:08,000 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:08,000 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:08,008 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 (15)] Forceful destruction successful, exit code 0 [2024-10-24 19:13:08,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:08,201 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-10-24 19:13:08,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2035506810, now seen corresponding path program 1 times [2024-10-24 19:13:08,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:08,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357765266] [2024-10-24 19:13:08,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:08,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:08,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:08,204 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:08,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-24 19:13:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:08,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 19:13:08,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:08,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 19:13:08,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-24 19:13:08,604 INFO L349 Elim1Store]: treesize reduction 86, result has 31.2 percent of original size [2024-10-24 19:13:08,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 59 [2024-10-24 19:13:08,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-10-24 19:13:08,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-10-24 19:13:08,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-10-24 19:13:08,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-24 19:13:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:08,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:13:08,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_621) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-10-24 19:13:08,868 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_621) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-10-24 19:13:08,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:08,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-24 19:13:08,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:08,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2024-10-24 19:13:08,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-10-24 19:13:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-24 19:13:10,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:10,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357765266] [2024-10-24 19:13:10,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357765266] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:13:10,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:13:10,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-24 19:13:10,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988781981] [2024-10-24 19:13:10,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:13:10,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 19:13:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:10,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 19:13:10,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=141, Unknown=9, NotChecked=50, Total=240 [2024-10-24 19:13:10,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 121 [2024-10-24 19:13:10,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 117 transitions, 497 flow. Second operand has 16 states, 16 states have (on average 30.125) internal successors, (482), 16 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:13:10,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:10,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 121 [2024-10-24 19:13:10,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:11,544 INFO L124 PetriNetUnfolderBase]: 329/1030 cut-off events. [2024-10-24 19:13:11,544 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-10-24 19:13:11,546 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-10-24 19:13:11,550 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 71 selfloop transitions, 23 changer transitions 0/122 dead transitions. [2024-10-24 19:13:11,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 122 transitions, 699 flow [2024-10-24 19:13:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:13:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 19:13:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 386 transitions. [2024-10-24 19:13:11,552 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.290007513148009 [2024-10-24 19:13:11,552 INFO L175 Difference]: Start difference. First operand has 133 places, 117 transitions, 497 flow. Second operand 11 states and 386 transitions. [2024-10-24 19:13:11,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 122 transitions, 699 flow [2024-10-24 19:13:11,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 122 transitions, 681 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-10-24 19:13:11,558 INFO L231 Difference]: Finished difference. Result has 141 places, 116 transitions, 521 flow [2024-10-24 19:13:11,558 INFO L260 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=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=521, PETRI_PLACES=141, PETRI_TRANSITIONS=116} [2024-10-24 19:13:11,558 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 35 predicate places. [2024-10-24 19:13:11,559 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 116 transitions, 521 flow [2024-10-24 19:13:11,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 30.125) internal successors, (482), 16 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:13:11,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:11,559 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:11,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-24 19:13:11,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:11,759 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-10-24 19:13:11,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2035506809, now seen corresponding path program 1 times [2024-10-24 19:13:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:11,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667122356] [2024-10-24 19:13:11,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:11,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:11,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:11,761 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:11,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 19:13:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:12,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-24 19:13:12,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:12,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 19:13:12,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 19:13:12,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-24 19:13:12,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-24 19:13:12,206 INFO L349 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2024-10-24 19:13:12,206 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-10-24 19:13:12,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2024-10-24 19:13:12,244 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-10-24 19:13:12,253 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-10-24 19:13:12,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-24 19:13: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 34 treesize of output 27 [2024-10-24 19:13: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 26 treesize of output 19 [2024-10-24 19:13:12,308 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-10-24 19:13:12,333 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-10-24 19:13:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:12,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:13:12,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_732) |c_~#c~0.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_732) |c_~#c~0.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_731) |c_~#c~0.base|) .cse1)))))) is different from false [2024-10-24 19:13:12,471 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_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_732) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_731) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_732 (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_732) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-10-24 19:13:12,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:12,649 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-10-24 19:13:12,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:12,657 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-10-24 19:13:12,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:12,673 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 74 treesize of output 77 [2024-10-24 19:13:12,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:12,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 113 [2024-10-24 19:13:12,713 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 26 treesize of output 20 [2024-10-24 19:13:12,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-10-24 19:13:13,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:13,124 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-10-24 19:13:13,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:13,138 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-10-24 19:13:13,148 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-10-24 19:13:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-24 19:13:14,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:14,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667122356] [2024-10-24 19:13:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667122356] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:13:14,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:13:14,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-24 19:13:14,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386415579] [2024-10-24 19:13:14,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:13:14,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 19:13:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:14,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 19:13:14,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=152, Unknown=4, NotChecked=50, Total=240 [2024-10-24 19:13:15,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 121 [2024-10-24 19:13:15,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 116 transitions, 521 flow. Second operand has 16 states, 16 states have (on average 22.125) internal successors, (354), 16 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:13:15,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:15,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 121 [2024-10-24 19:13:15,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:17,779 INFO L124 PetriNetUnfolderBase]: 465/1264 cut-off events. [2024-10-24 19:13:17,779 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-10-24 19:13:17,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2570 conditions, 1264 events. 465/1264 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7462 event pairs, 422 based on Foata normal form. 6/851 useless extension candidates. Maximal degree in co-relation 2335. Up to 945 conditions per place. [2024-10-24 19:13:17,783 INFO L140 encePairwiseOnDemand]: 111/121 looper letters, 77 selfloop transitions, 24 changer transitions 0/121 dead transitions. [2024-10-24 19:13:17,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 121 transitions, 737 flow [2024-10-24 19:13:17,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 19:13:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-24 19:13:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 325 transitions. [2024-10-24 19:13:17,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2238292011019284 [2024-10-24 19:13:17,786 INFO L175 Difference]: Start difference. First operand has 141 places, 116 transitions, 521 flow. Second operand 12 states and 325 transitions. [2024-10-24 19:13:17,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 121 transitions, 737 flow [2024-10-24 19:13:17,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 121 transitions, 650 flow, removed 12 selfloop flow, removed 12 redundant places. [2024-10-24 19:13:17,789 INFO L231 Difference]: Finished difference. Result has 142 places, 118 transitions, 496 flow [2024-10-24 19:13:17,790 INFO L260 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=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=496, PETRI_PLACES=142, PETRI_TRANSITIONS=118} [2024-10-24 19:13:17,790 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 36 predicate places. [2024-10-24 19:13:17,790 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 118 transitions, 496 flow [2024-10-24 19:13:17,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 22.125) internal successors, (354), 16 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:13:17,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:17,790 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2024-10-24 19:13:17,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-24 19:13:17,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:17,991 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-10-24 19:13:17,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:17,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1435462967, now seen corresponding path program 2 times [2024-10-24 19:13:17,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:17,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980504726] [2024-10-24 19:13:17,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:13:17,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:17,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:17,993 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:17,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-24 19:13:18,371 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 19:13:18,371 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:13:18,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:13:18,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:18,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:13:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:18,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:18,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980504726] [2024-10-24 19:13:18,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980504726] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:13:18,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:13:18,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-24 19:13:18,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992734507] [2024-10-24 19:13:18,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:13:18,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 19:13:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:18,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 19:13:18,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-24 19:13:18,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 121 [2024-10-24 19:13:18,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 118 transitions, 496 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-10-24 19:13:18,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:18,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 121 [2024-10-24 19:13:18,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:19,201 INFO L124 PetriNetUnfolderBase]: 127/681 cut-off events. [2024-10-24 19:13:19,201 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2024-10-24 19:13:19,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 681 events. 127/681 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2738 event pairs, 105 based on Foata normal form. 12/619 useless extension candidates. Maximal degree in co-relation 1127. Up to 264 conditions per place. [2024-10-24 19:13:19,204 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 90 selfloop transitions, 23 changer transitions 0/170 dead transitions. [2024-10-24 19:13:19,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 170 transitions, 1166 flow [2024-10-24 19:13:19,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 19:13:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-24 19:13:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 897 transitions. [2024-10-24 19:13:19,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6177685950413223 [2024-10-24 19:13:19,206 INFO L175 Difference]: Start difference. First operand has 142 places, 118 transitions, 496 flow. Second operand 12 states and 897 transitions. [2024-10-24 19:13:19,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 170 transitions, 1166 flow [2024-10-24 19:13:19,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 170 transitions, 1026 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-10-24 19:13:19,210 INFO L231 Difference]: Finished difference. Result has 151 places, 131 transitions, 680 flow [2024-10-24 19:13:19,210 INFO L260 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-10-24 19:13:19,210 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 45 predicate places. [2024-10-24 19:13:19,210 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 131 transitions, 680 flow [2024-10-24 19:13:19,211 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-10-24 19:13:19,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:19,211 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-10-24 19:13:19,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-24 19:13:19,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:19,411 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-10-24 19:13:19,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:19,412 INFO L85 PathProgramCache]: Analyzing trace with hash -929981687, now seen corresponding path program 3 times [2024-10-24 19:13:19,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:19,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958934487] [2024-10-24 19:13:19,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 19:13:19,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:19,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:19,413 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:19,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-24 19:13:27,051 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-24 19:13:27,051 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:13:27,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 19:13:27,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:27,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:13:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:27,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:27,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958934487] [2024-10-24 19:13:27,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958934487] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:13:27,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:13:27,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-24 19:13:27,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584815456] [2024-10-24 19:13:27,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:13:27,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 19:13:27,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:27,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 19:13:27,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-10-24 19:13:27,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 121 [2024-10-24 19:13:27,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 131 transitions, 680 flow. Second operand has 24 states, 24 states have (on average 71.45833333333333) internal successors, (1715), 24 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:13:27,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:27,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 121 [2024-10-24 19:13:27,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:29,458 INFO L124 PetriNetUnfolderBase]: 127/921 cut-off events. [2024-10-24 19:13:29,458 INFO L125 PetriNetUnfolderBase]: For 1766/1766 co-relation queries the response was YES. [2024-10-24 19:13:29,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2355 conditions, 921 events. 127/921 cut-off events. For 1766/1766 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2774 event pairs, 105 based on Foata normal form. 24/871 useless extension candidates. Maximal degree in co-relation 1598. Up to 264 conditions per place. [2024-10-24 19:13:29,462 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 150 selfloop transitions, 47 changer transitions 0/254 dead transitions. [2024-10-24 19:13:29,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 254 transitions, 2038 flow [2024-10-24 19:13:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 19:13:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-24 19:13:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1767 transitions. [2024-10-24 19:13:29,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6084710743801653 [2024-10-24 19:13:29,483 INFO L175 Difference]: Start difference. First operand has 151 places, 131 transitions, 680 flow. Second operand 24 states and 1767 transitions. [2024-10-24 19:13:29,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 254 transitions, 2038 flow [2024-10-24 19:13:29,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 254 transitions, 2026 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:13:29,490 INFO L231 Difference]: Finished difference. Result has 184 places, 156 transitions, 1212 flow [2024-10-24 19:13:29,490 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1212, PETRI_PLACES=184, PETRI_TRANSITIONS=156} [2024-10-24 19:13:29,490 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 78 predicate places. [2024-10-24 19:13:29,490 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 156 transitions, 1212 flow [2024-10-24 19:13:29,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 71.45833333333333) internal successors, (1715), 24 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:13:29,491 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:29,491 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1] [2024-10-24 19:13:29,531 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 (19)] Ended with exit code 0 [2024-10-24 19:13:29,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:29,692 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-10-24 19:13:29,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1456104567, now seen corresponding path program 4 times [2024-10-24 19:13:29,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:29,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013383318] [2024-10-24 19:13:29,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 19:13:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:29,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:29,695 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:29,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process