./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:42:36,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:42:36,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:42:36,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:42:36,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:42:36,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:42:36,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:42:36,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:42:36,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:42:36,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:42:36,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:42:36,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:42:36,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:42:36,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:42:36,295 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:42:36,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:42:36,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:42:36,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:42:36,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:42:36,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:42:36,302 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:42:36,303 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:42:36,303 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:42:36,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:42:36,306 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:42:36,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:42:36,307 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:42:36,307 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:42:36,307 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:42:36,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:42:36,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:42:36,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:42:36,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:42:36,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:42:36,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:42:36,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:42:36,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:42:36,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:42:36,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:42:36,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:42:36,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:42:36,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:42:36,312 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 -> 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 [2024-11-19 09:42:36,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:42:36,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:42:36,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:42:36,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:42:36,642 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:42:36,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-11-19 09:42:38,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:42:38,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:42:38,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-11-19 09:42:38,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41d2cca3e/7b754d9d26e0491486c9b65f3d107ead/FLAG7f4a548b5 [2024-11-19 09:42:38,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41d2cca3e/7b754d9d26e0491486c9b65f3d107ead [2024-11-19 09:42:38,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:42:38,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:42:38,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:42:38,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:42:38,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:42:38,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:38" (1/1) ... [2024-11-19 09:42:38,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d0c3eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:38, skipping insertion in model container [2024-11-19 09:42:38,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:38" (1/1) ... [2024-11-19 09:42:38,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:42:39,037 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,038 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,038 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,039 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:42:39,115 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 09:42:39,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@191d8c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:39, skipping insertion in model container [2024-11-19 09:42:39,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:42:39,117 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:42:39,119 INFO L158 Benchmark]: Toolchain (without parser) took 676.16ms. Allocated memory is still 159.4MB. Free memory was 100.8MB in the beginning and 81.0MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 09:42:39,119 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:42:39,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.34ms. Allocated memory is still 159.4MB. Free memory was 100.8MB in the beginning and 81.0MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 09:42:39,121 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.20ms. Allocated memory is still 159.4MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.34ms. Allocated memory is still 159.4MB. Free memory was 100.8MB in the beginning and 81.0MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1051]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:42:41,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:42:41,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:42:41,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:42:41,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:42:41,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:42:41,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:42:41,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:42:41,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:42:41,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:42:41,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:42:41,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:42:41,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:42:41,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:42:41,354 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:42:41,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:42:41,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:42:41,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:42:41,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:42:41,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:42:41,358 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:42:41,359 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:42:41,359 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:42:41,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:42:41,360 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:42:41,360 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:42:41,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:42:41,361 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:42:41,361 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:42:41,362 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:42:41,362 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:42:41,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:42:41,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:42:41,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:42:41,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:42:41,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:42:41,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:42:41,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:42:41,370 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:42:41,371 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:42:41,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:42:41,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:42:41,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:42:41,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:42:41,373 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 -> 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 [2024-11-19 09:42:41,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:42:41,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:42:41,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:42:41,763 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:42:41,763 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:42:41,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-11-19 09:42:43,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:42:43,661 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:42:43,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-11-19 09:42:43,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594675a49/b66cd79c76f449d793123a02e3a17fd2/FLAG30440c67f [2024-11-19 09:42:43,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594675a49/b66cd79c76f449d793123a02e3a17fd2 [2024-11-19 09:42:43,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:42:43,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:42:43,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:42:43,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:42:43,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:42:43,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:43" (1/1) ... [2024-11-19 09:42:43,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4453d891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:43, skipping insertion in model container [2024-11-19 09:42:43,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:43" (1/1) ... [2024-11-19 09:42:44,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:42:44,548 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:44,550 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:44,551 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:44,551 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:44,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:42:44,646 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:42:44,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:42:44,699 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:44,699 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:44,700 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:44,700 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:44,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:42:44,741 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:42:44,793 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:44,794 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:44,794 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:44,794 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:44,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:42:44,889 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:42:44,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44 WrapperNode [2024-11-19 09:42:44,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:42:44,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:42:44,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:42:44,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:42:44,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (1/1) ... [2024-11-19 09:42:44,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (1/1) ... [2024-11-19 09:42:44,978 INFO L138 Inliner]: procedures = 284, calls = 136, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 313 [2024-11-19 09:42:44,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:42:44,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:42:44,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:42:44,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:42:44,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (1/1) ... [2024-11-19 09:42:44,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (1/1) ... [2024-11-19 09:42:45,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (1/1) ... [2024-11-19 09:42:45,062 INFO L175 MemorySlicer]: Split 110 memory accesses to 4 slices as follows [2, 2, 5, 101]. 92 percent of accesses are in the largest equivalence class. The 87 initializations are split as follows [2, 0, 5, 80]. The 13 writes are split as follows [0, 1, 0, 12]. [2024-11-19 09:42:45,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (1/1) ... [2024-11-19 09:42:45,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (1/1) ... [2024-11-19 09:42:45,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (1/1) ... [2024-11-19 09:42:45,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (1/1) ... [2024-11-19 09:42:45,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (1/1) ... [2024-11-19 09:42:45,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (1/1) ... [2024-11-19 09:42:45,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:42:45,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:42:45,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:42:45,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:42:45,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (1/1) ... [2024-11-19 09:42:45,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:42:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:42:45,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:42:45,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:42:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:42:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:42:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:42:45,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 09:42:45,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:42:45,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:42:45,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:42:45,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:42:45,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 09:42:45,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:42:45,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:42:45,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:42:45,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:42:45,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 09:42:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 09:42:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 09:42:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 09:42:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-19 09:42:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:42:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:42:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:42:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 09:42:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 09:42:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 09:42:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 09:42:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 09:42:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:42:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:42:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:42:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:42:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:42:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:42:45,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:42:45,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 09:42:45,225 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 09:42:45,225 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 09:42:45,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:42:45,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:42:45,228 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:42:45,462 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:42:45,465 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:42:46,557 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:42:46,557 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:42:48,542 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:42:48,542 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-19 09:42:48,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:42:48 BoogieIcfgContainer [2024-11-19 09:42:48,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:42:48,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:42:48,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:42:48,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:42:48,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:42:43" (1/3) ... [2024-11-19 09:42:48,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1e9b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:42:48, skipping insertion in model container [2024-11-19 09:42:48,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:44" (2/3) ... [2024-11-19 09:42:48,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1e9b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:42:48, skipping insertion in model container [2024-11-19 09:42:48,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:42:48" (3/3) ... [2024-11-19 09:42:48,554 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing.i [2024-11-19 09:42:48,572 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:42:48,573 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-11-19 09:42:48,573 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:42:48,658 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 09:42:48,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 133 transitions, 273 flow [2024-11-19 09:42:48,760 INFO L124 PetriNetUnfolderBase]: 18/145 cut-off events. [2024-11-19 09:42:48,761 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:42:48,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 145 events. 18/145 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 530 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2024-11-19 09:42:48,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 133 transitions, 273 flow [2024-11-19 09:42:48,771 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 133 transitions, 273 flow [2024-11-19 09:42:48,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:42:48,791 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;@2bb88de4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:42:48,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2024-11-19 09:42:48,803 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:42:48,803 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-19 09:42:48,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:42:48,804 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:48,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:42:48,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:42:48,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:48,813 INFO L85 PathProgramCache]: Analyzing trace with hash 852780, now seen corresponding path program 1 times [2024-11-19 09:42:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:48,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128234069] [2024-11-19 09:42:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:48,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:48,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:48,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:42:48,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:42:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:49,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:42:49,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:49,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:42:49,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:49,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:49,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128234069] [2024-11-19 09:42:49,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128234069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:49,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:49,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:49,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584248431] [2024-11-19 09:42:49,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:49,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:49,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:49,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:49,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:49,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 133 [2024-11-19 09:42:49,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 133 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:49,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:49,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 133 [2024-11-19 09:42:49,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:50,023 INFO L124 PetriNetUnfolderBase]: 125/490 cut-off events. [2024-11-19 09:42:50,024 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-19 09:42:50,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 490 events. 125/490 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2675 event pairs, 64 based on Foata normal form. 52/431 useless extension candidates. Maximal degree in co-relation 675. Up to 177 conditions per place. [2024-11-19 09:42:50,031 INFO L140 encePairwiseOnDemand]: 112/133 looper letters, 66 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2024-11-19 09:42:50,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 139 transitions, 425 flow [2024-11-19 09:42:50,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2024-11-19 09:42:50,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7048872180451128 [2024-11-19 09:42:50,054 INFO L175 Difference]: Start difference. First operand has 118 places, 133 transitions, 273 flow. Second operand 4 states and 375 transitions. [2024-11-19 09:42:50,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 139 transitions, 425 flow [2024-11-19 09:42:50,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 139 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:42:50,063 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 253 flow [2024-11-19 09:42:50,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2024-11-19 09:42:50,070 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2024-11-19 09:42:50,072 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 253 flow [2024-11-19 09:42:50,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:50,073 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:50,073 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:42:50,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 09:42:50,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:50,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:42:50,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash 852781, now seen corresponding path program 1 times [2024-11-19 09:42:50,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:50,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171831712] [2024-11-19 09:42:50,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:50,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:50,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:50,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:42:50,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:42:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:50,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:42:50,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:42:50,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:50,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:50,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171831712] [2024-11-19 09:42:50,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171831712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:50,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:50,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:50,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097378654] [2024-11-19 09:42:50,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:50,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:50,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:50,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:50,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:50,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 133 [2024-11-19 09:42:50,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:50,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:50,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 133 [2024-11-19 09:42:50,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:51,145 INFO L124 PetriNetUnfolderBase]: 127/521 cut-off events. [2024-11-19 09:42:51,145 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2024-11-19 09:42:51,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 521 events. 127/521 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2796 event pairs, 105 based on Foata normal form. 3/410 useless extension candidates. Maximal degree in co-relation 743. Up to 274 conditions per place. [2024-11-19 09:42:51,149 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 47 selfloop transitions, 5 changer transitions 0/120 dead transitions. [2024-11-19 09:42:51,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 371 flow [2024-11-19 09:42:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2024-11-19 09:42:51,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6447368421052632 [2024-11-19 09:42:51,156 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 253 flow. Second operand 4 states and 343 transitions. [2024-11-19 09:42:51,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 371 flow [2024-11-19 09:42:51,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 120 transitions, 359 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:42:51,161 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 286 flow [2024-11-19 09:42:51,162 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2024-11-19 09:42:51,163 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-19 09:42:51,163 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 286 flow [2024-11-19 09:42:51,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:51,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:51,164 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:42:51,171 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 (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:42:51,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:51,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:42:51,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash -363827024, now seen corresponding path program 1 times [2024-11-19 09:42:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:51,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14378337] [2024-11-19 09:42:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:51,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:51,372 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:42:51,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:42:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:51,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:42:51,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:51,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:42:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:42:51,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:51,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:51,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14378337] [2024-11-19 09:42:51,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14378337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:51,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:51,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:51,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528671995] [2024-11-19 09:42:51,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:51,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:42:51,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:51,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:42:51,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:42:51,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 133 [2024-11-19 09:42:51,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:51,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:51,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 133 [2024-11-19 09:42:51,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:51,977 INFO L124 PetriNetUnfolderBase]: 127/520 cut-off events. [2024-11-19 09:42:51,978 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-19 09:42:51,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 520 events. 127/520 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2810 event pairs, 105 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 811. Up to 270 conditions per place. [2024-11-19 09:42:51,982 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 45 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2024-11-19 09:42:51,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 380 flow [2024-11-19 09:42:51,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:42:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:42:51,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-11-19 09:42:51,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766917293233082 [2024-11-19 09:42:51,984 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 286 flow. Second operand 3 states and 270 transitions. [2024-11-19 09:42:51,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 380 flow [2024-11-19 09:42:51,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:42:51,988 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 287 flow [2024-11-19 09:42:51,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2024-11-19 09:42:51,989 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-19 09:42:51,989 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 287 flow [2024-11-19 09:42:51,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:51,989 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:51,990 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:42:51,997 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-11-19 09:42:52,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:52,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:42:52,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:52,195 INFO L85 PathProgramCache]: Analyzing trace with hash -363827023, now seen corresponding path program 1 times [2024-11-19 09:42:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:52,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16230671] [2024-11-19 09:42:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:52,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:52,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:52,198 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:42:52,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:42:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:52,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:42:52,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:52,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:42:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:42:52,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:52,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16230671] [2024-11-19 09:42:52,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16230671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:52,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:52,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234667230] [2024-11-19 09:42:52,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:52,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:42:52,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:52,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:42:52,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:42:52,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 133 [2024-11-19 09:42:52,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 287 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:52,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:52,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 133 [2024-11-19 09:42:52,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:52,805 INFO L124 PetriNetUnfolderBase]: 127/519 cut-off events. [2024-11-19 09:42:52,805 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-11-19 09:42:52,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 519 events. 127/519 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2810 event pairs, 105 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 810. Up to 270 conditions per place. [2024-11-19 09:42:52,809 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 45 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2024-11-19 09:42:52,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 381 flow [2024-11-19 09:42:52,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:42:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:42:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-11-19 09:42:52,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766917293233082 [2024-11-19 09:42:52,811 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 287 flow. Second operand 3 states and 270 transitions. [2024-11-19 09:42:52,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 381 flow [2024-11-19 09:42:52,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:42:52,815 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 285 flow [2024-11-19 09:42:52,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=118, PETRI_TRANSITIONS=118} [2024-11-19 09:42:52,816 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2024-11-19 09:42:52,816 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 285 flow [2024-11-19 09:42:52,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:52,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:52,817 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-19 09:42:52,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 09:42:53,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:53,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:42:53,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1606269168, now seen corresponding path program 1 times [2024-11-19 09:42:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:53,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20677200] [2024-11-19 09:42:53,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:53,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:53,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:53,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:42:53,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:42:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:53,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:42:53,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:42:53,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:53,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:53,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20677200] [2024-11-19 09:42:53,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20677200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:53,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:53,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:53,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855279132] [2024-11-19 09:42:53,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:53,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:42:53,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:53,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:42:53,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:42:53,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-19 09:42:53,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 118 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:53,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:53,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-19 09:42:53,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:53,486 INFO L124 PetriNetUnfolderBase]: 126/541 cut-off events. [2024-11-19 09:42:53,486 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-11-19 09:42:53,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 541 events. 126/541 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2814 event pairs, 105 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 841. Up to 270 conditions per place. [2024-11-19 09:42:53,490 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 49 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2024-11-19 09:42:53,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 401 flow [2024-11-19 09:42:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:42:53,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:42:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-11-19 09:42:53,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6967418546365914 [2024-11-19 09:42:53,492 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 285 flow. Second operand 3 states and 278 transitions. [2024-11-19 09:42:53,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 401 flow [2024-11-19 09:42:53,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 122 transitions, 391 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:42:53,496 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 290 flow [2024-11-19 09:42:53,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=119, PETRI_TRANSITIONS=118} [2024-11-19 09:42:53,497 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-19 09:42:53,497 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 290 flow [2024-11-19 09:42:53,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:53,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:53,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:53,505 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-11-19 09:42:53,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:53,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:42:53,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1606265027, now seen corresponding path program 1 times [2024-11-19 09:42:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:53,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143512774] [2024-11-19 09:42:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:53,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:53,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:53,701 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:42:53,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:42:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:53,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:42:53,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:53,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:42:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:42:53,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:53,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143512774] [2024-11-19 09:42:53,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143512774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:53,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:53,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:53,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429887794] [2024-11-19 09:42:53,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:53,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:53,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:53,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:54,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-19 09:42:54,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:54,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:54,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-19 09:42:54,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:54,453 INFO L124 PetriNetUnfolderBase]: 126/537 cut-off events. [2024-11-19 09:42:54,453 INFO L125 PetriNetUnfolderBase]: For 33/34 co-relation queries the response was YES. [2024-11-19 09:42:54,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 537 events. 126/537 cut-off events. For 33/34 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2790 event pairs, 105 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 837. Up to 274 conditions per place. [2024-11-19 09:42:54,457 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 46 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2024-11-19 09:42:54,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 116 transitions, 386 flow [2024-11-19 09:42:54,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2024-11-19 09:42:54,459 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6240601503759399 [2024-11-19 09:42:54,459 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 290 flow. Second operand 4 states and 332 transitions. [2024-11-19 09:42:54,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 116 transitions, 386 flow [2024-11-19 09:42:54,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:42:54,462 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 291 flow [2024-11-19 09:42:54,463 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=119, PETRI_TRANSITIONS=116} [2024-11-19 09:42:54,463 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-19 09:42:54,464 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 291 flow [2024-11-19 09:42:54,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:54,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:54,464 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:54,472 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-11-19 09:42:54,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:54,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:42:54,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1606265026, now seen corresponding path program 1 times [2024-11-19 09:42:54,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:54,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441628494] [2024-11-19 09:42:54,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:54,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:54,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:54,670 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:42:54,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:42:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:54,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:42:54,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:54,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:42:54,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:42:54,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:54,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:54,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441628494] [2024-11-19 09:42:54,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441628494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:54,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:54,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:54,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543128068] [2024-11-19 09:42:54,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:54,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:54,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:54,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:54,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:55,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 133 [2024-11-19 09:42:55,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 291 flow. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:55,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:55,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 133 [2024-11-19 09:42:55,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:55,374 INFO L124 PetriNetUnfolderBase]: 126/533 cut-off events. [2024-11-19 09:42:55,375 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-11-19 09:42:55,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 533 events. 126/533 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2787 event pairs, 105 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 841. Up to 272 conditions per place. [2024-11-19 09:42:55,378 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 43 selfloop transitions, 7 changer transitions 0/114 dead transitions. [2024-11-19 09:42:55,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 114 transitions, 387 flow [2024-11-19 09:42:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:42:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:42:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2024-11-19 09:42:55,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909774436090226 [2024-11-19 09:42:55,381 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 291 flow. Second operand 5 states and 393 transitions. [2024-11-19 09:42:55,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 114 transitions, 387 flow [2024-11-19 09:42:55,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 114 transitions, 379 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:42:55,385 INFO L231 Difference]: Finished difference. Result has 118 places, 114 transitions, 293 flow [2024-11-19 09:42:55,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=118, PETRI_TRANSITIONS=114} [2024-11-19 09:42:55,386 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2024-11-19 09:42:55,387 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 114 transitions, 293 flow [2024-11-19 09:42:55,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:55,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:55,387 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:55,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 09:42:55,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:55,588 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:42:55,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1727458735, now seen corresponding path program 1 times [2024-11-19 09:42:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:55,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628630121] [2024-11-19 09:42:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:55,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:55,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:55,591 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:42:55,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 09:42:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:56,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:42:56,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:56,296 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 09:42:56,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-19 09:42:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:42:56,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:56,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:56,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628630121] [2024-11-19 09:42:56,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628630121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:56,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:56,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086064692] [2024-11-19 09:42:56,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:56,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:56,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:56,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:56,513 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-19 09:42:56,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 114 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:56,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:56,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-19 09:42:56,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:56,911 INFO L124 PetriNetUnfolderBase]: 125/503 cut-off events. [2024-11-19 09:42:56,911 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2024-11-19 09:42:56,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 503 events. 125/503 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2609 event pairs, 64 based on Foata normal form. 2/397 useless extension candidates. Maximal degree in co-relation 813. Up to 180 conditions per place. [2024-11-19 09:42:56,915 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 67 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2024-11-19 09:42:56,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 479 flow [2024-11-19 09:42:56,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2024-11-19 09:42:56,917 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6654135338345865 [2024-11-19 09:42:56,917 INFO L175 Difference]: Start difference. First operand has 118 places, 114 transitions, 293 flow. Second operand 4 states and 354 transitions. [2024-11-19 09:42:56,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 479 flow [2024-11-19 09:42:56,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 135 transitions, 465 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:42:56,921 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 285 flow [2024-11-19 09:42:56,921 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2024-11-19 09:42:56,922 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2024-11-19 09:42:56,922 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 285 flow [2024-11-19 09:42:56,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:56,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:56,922 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:56,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 09:42:57,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:57,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:42:57,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1727458736, now seen corresponding path program 1 times [2024-11-19 09:42:57,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:57,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73782370] [2024-11-19 09:42:57,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:57,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:57,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:57,130 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:42:57,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 09:42:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:57,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:42:57,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:57,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:42:57,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:42:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:42:58,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:58,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:58,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73782370] [2024-11-19 09:42:58,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73782370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:58,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:58,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:58,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168656373] [2024-11-19 09:42:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:58,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:42:58,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:58,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:42:58,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:42:58,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-19 09:42:58,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:58,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:58,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-19 09:42:58,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:58,705 INFO L124 PetriNetUnfolderBase]: 128/561 cut-off events. [2024-11-19 09:42:58,705 INFO L125 PetriNetUnfolderBase]: For 52/53 co-relation queries the response was YES. [2024-11-19 09:42:58,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 561 events. 128/561 cut-off events. For 52/53 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3030 event pairs, 106 based on Foata normal form. 2/435 useless extension candidates. Maximal degree in co-relation 857. Up to 281 conditions per place. [2024-11-19 09:42:58,709 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 53 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2024-11-19 09:42:58,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 119 transitions, 431 flow [2024-11-19 09:42:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2024-11-19 09:42:58,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6409774436090225 [2024-11-19 09:42:58,713 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 285 flow. Second operand 4 states and 341 transitions. [2024-11-19 09:42:58,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 119 transitions, 431 flow [2024-11-19 09:42:58,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 119 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:42:58,716 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 321 flow [2024-11-19 09:42:58,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2024-11-19 09:42:58,718 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2024-11-19 09:42:58,718 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 321 flow [2024-11-19 09:42:58,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:58,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:58,719 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:58,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 09:42:58,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:58,919 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:42:58,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2011614171, now seen corresponding path program 1 times [2024-11-19 09:42:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611280913] [2024-11-19 09:42:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:58,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:58,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:58,923 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:42:58,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 09:42:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:59,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 09:42:59,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:59,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:42:59,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:42:59,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 09:42:59,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 09:43:00,076 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:43:00,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:43:00,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:43:00,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 09:43:00,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 09:43:00,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 23 treesize of output 16 [2024-11-19 09:43:00,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 09:43:00,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 09:43:00,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 09:43:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:43:00,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:43:00,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:00,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611280913] [2024-11-19 09:43:00,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611280913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:43:00,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:43:00,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:43:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709306592] [2024-11-19 09:43:00,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:43:00,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:43:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:00,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:43:00,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:43:01,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 133 [2024-11-19 09:43:01,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 321 flow. Second operand has 10 states, 10 states have (on average 57.0) internal successors, (570), 10 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:01,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:01,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 133 [2024-11-19 09:43:01,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:02,544 INFO L124 PetriNetUnfolderBase]: 128/560 cut-off events. [2024-11-19 09:43:02,544 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2024-11-19 09:43:02,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 560 events. 128/560 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3013 event pairs, 106 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 868. Up to 294 conditions per place. [2024-11-19 09:43:02,548 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 68 selfloop transitions, 11 changer transitions 0/132 dead transitions. [2024-11-19 09:43:02,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 132 transitions, 517 flow [2024-11-19 09:43:02,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:43:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:43:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 695 transitions. [2024-11-19 09:43:02,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4750512645249487 [2024-11-19 09:43:02,551 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 321 flow. Second operand 11 states and 695 transitions. [2024-11-19 09:43:02,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 132 transitions, 517 flow [2024-11-19 09:43:02,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 132 transitions, 515 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:43:02,554 INFO L231 Difference]: Finished difference. Result has 131 places, 121 transitions, 377 flow [2024-11-19 09:43:02,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=377, PETRI_PLACES=131, PETRI_TRANSITIONS=121} [2024-11-19 09:43:02,555 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2024-11-19 09:43:02,555 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 121 transitions, 377 flow [2024-11-19 09:43:02,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 57.0) internal successors, (570), 10 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:02,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:02,556 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:43:02,564 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 (11)] Forceful destruction successful, exit code 0 [2024-11-19 09:43:02,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:43:02,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:43:02,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2011614170, now seen corresponding path program 1 times [2024-11-19 09:43:02,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:02,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657600617] [2024-11-19 09:43:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:43:02,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:43:02,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:02,762 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:43:02,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 09:43:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:43:03,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 09:43:03,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:03,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:43:03,639 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 29 treesize of output 28 [2024-11-19 09:43:03,734 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-19 09:43:03,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2024-11-19 09:43:03,782 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 33 treesize of output 26 [2024-11-19 09:43:03,823 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 33 treesize of output 26 [2024-11-19 09:43:03,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-19 09:43:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:43:03,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:43:03,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:03,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657600617] [2024-11-19 09:43:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657600617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:43:03,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:43:03,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:43:03,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789278123] [2024-11-19 09:43:03,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:43:03,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:43:03,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:03,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:43:03,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:43:05,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 133 [2024-11-19 09:43:05,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 121 transitions, 377 flow. Second operand has 10 states, 10 states have (on average 63.0) internal successors, (630), 10 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:05,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:05,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 133 [2024-11-19 09:43:05,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:06,457 INFO L124 PetriNetUnfolderBase]: 126/530 cut-off events. [2024-11-19 09:43:06,458 INFO L125 PetriNetUnfolderBase]: For 37/38 co-relation queries the response was YES. [2024-11-19 09:43:06,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 530 events. 126/530 cut-off events. For 37/38 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2866 event pairs, 64 based on Foata normal form. 2/428 useless extension candidates. Maximal degree in co-relation 877. Up to 192 conditions per place. [2024-11-19 09:43:06,460 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 75 selfloop transitions, 20 changer transitions 0/152 dead transitions. [2024-11-19 09:43:06,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 152 transitions, 639 flow [2024-11-19 09:43:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:43:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:43:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 766 transitions. [2024-11-19 09:43:06,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5235816814764184 [2024-11-19 09:43:06,462 INFO L175 Difference]: Start difference. First operand has 131 places, 121 transitions, 377 flow. Second operand 11 states and 766 transitions. [2024-11-19 09:43:06,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 152 transitions, 639 flow [2024-11-19 09:43:06,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 152 transitions, 635 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:43:06,465 INFO L231 Difference]: Finished difference. Result has 144 places, 126 transitions, 465 flow [2024-11-19 09:43:06,465 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=465, PETRI_PLACES=144, PETRI_TRANSITIONS=126} [2024-11-19 09:43:06,466 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2024-11-19 09:43:06,466 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 465 flow [2024-11-19 09:43:06,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 63.0) internal successors, (630), 10 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:06,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:06,466 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:43:06,472 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-11-19 09:43:06,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:43:06,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:43:06,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2064469345, now seen corresponding path program 1 times [2024-11-19 09:43:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:06,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182345388] [2024-11-19 09:43:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:43:06,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:43:06,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:06,670 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:43:06,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 09:43:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:43:06,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:43:06,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:06,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:43:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:43:06,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:43:06,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:06,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182345388] [2024-11-19 09:43:06,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182345388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:43:06,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:43:06,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:43:06,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997635556] [2024-11-19 09:43:06,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:43:06,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:43:06,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:06,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:43:06,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:43:07,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 133 [2024-11-19 09:43:07,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 126 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:07,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:07,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 133 [2024-11-19 09:43:07,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:07,325 INFO L124 PetriNetUnfolderBase]: 127/548 cut-off events. [2024-11-19 09:43:07,325 INFO L125 PetriNetUnfolderBase]: For 121/122 co-relation queries the response was YES. [2024-11-19 09:43:07,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 548 events. 127/548 cut-off events. For 121/122 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2935 event pairs, 105 based on Foata normal form. 8/447 useless extension candidates. Maximal degree in co-relation 928. Up to 271 conditions per place. [2024-11-19 09:43:07,328 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 48 selfloop transitions, 11 changer transitions 0/124 dead transitions. [2024-11-19 09:43:07,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 124 transitions, 579 flow [2024-11-19 09:43:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:43:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:43:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 338 transitions. [2024-11-19 09:43:07,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6353383458646616 [2024-11-19 09:43:07,330 INFO L175 Difference]: Start difference. First operand has 144 places, 126 transitions, 465 flow. Second operand 4 states and 338 transitions. [2024-11-19 09:43:07,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 124 transitions, 579 flow [2024-11-19 09:43:07,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 124 transitions, 555 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-19 09:43:07,334 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 459 flow [2024-11-19 09:43:07,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=459, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2024-11-19 09:43:07,335 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2024-11-19 09:43:07,335 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 459 flow [2024-11-19 09:43:07,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:07,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:07,335 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:43:07,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 09:43:07,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:43:07,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:43:07,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2064469346, now seen corresponding path program 1 times [2024-11-19 09:43:07,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:07,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274579537] [2024-11-19 09:43:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:43:07,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:43:07,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:07,542 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:43:07,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 09:43:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:43:07,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:43:07,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:07,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:43:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:43:07,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:43:07,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:07,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274579537] [2024-11-19 09:43:07,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274579537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:43:07,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:43:07,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:43:07,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531059173] [2024-11-19 09:43:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:43:07,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:43:07,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:07,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:43:07,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:43:07,899 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-19 09:43:07,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:07,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:07,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-19 09:43:07,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:08,184 INFO L124 PetriNetUnfolderBase]: 127/540 cut-off events. [2024-11-19 09:43:08,184 INFO L125 PetriNetUnfolderBase]: For 117/118 co-relation queries the response was YES. [2024-11-19 09:43:08,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 540 events. 127/540 cut-off events. For 117/118 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2895 event pairs, 105 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 905. Up to 271 conditions per place. [2024-11-19 09:43:08,188 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 50 selfloop transitions, 11 changer transitions 0/122 dead transitions. [2024-11-19 09:43:08,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 122 transitions, 577 flow [2024-11-19 09:43:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:43:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:43:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2024-11-19 09:43:08,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6240601503759399 [2024-11-19 09:43:08,190 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 459 flow. Second operand 4 states and 332 transitions. [2024-11-19 09:43:08,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 122 transitions, 577 flow [2024-11-19 09:43:08,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 122 transitions, 555 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:43:08,194 INFO L231 Difference]: Finished difference. Result has 138 places, 122 transitions, 455 flow [2024-11-19 09:43:08,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=455, PETRI_PLACES=138, PETRI_TRANSITIONS=122} [2024-11-19 09:43:08,195 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 20 predicate places. [2024-11-19 09:43:08,196 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 122 transitions, 455 flow [2024-11-19 09:43:08,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:08,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:08,196 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:43:08,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-19 09:43:08,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:43:08,397 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:43:08,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1089690184, now seen corresponding path program 1 times [2024-11-19 09:43:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:08,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769193920] [2024-11-19 09:43:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:43:08,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:43:08,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:08,403 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:43:08,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 09:43:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:43:08,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:43:08,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:43:08,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:43:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:43:08,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:08,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769193920] [2024-11-19 09:43:08,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769193920] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:43:08,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:43:08,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 09:43:08,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919269655] [2024-11-19 09:43:08,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:43:08,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:43:08,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:08,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:43:08,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:43:08,685 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-19 09:43:08,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 122 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:08,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:08,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-19 09:43:08,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:09,174 INFO L124 PetriNetUnfolderBase]: 127/590 cut-off events. [2024-11-19 09:43:09,174 INFO L125 PetriNetUnfolderBase]: For 212/213 co-relation queries the response was YES. [2024-11-19 09:43:09,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 590 events. 127/590 cut-off events. For 212/213 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3029 event pairs, 105 based on Foata normal form. 6/494 useless extension candidates. Maximal degree in co-relation 968. Up to 267 conditions per place. [2024-11-19 09:43:09,178 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 63 selfloop transitions, 11 changer transitions 0/137 dead transitions. [2024-11-19 09:43:09,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 715 flow [2024-11-19 09:43:09,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:43:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:43:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2024-11-19 09:43:09,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.650375939849624 [2024-11-19 09:43:09,180 INFO L175 Difference]: Start difference. First operand has 138 places, 122 transitions, 455 flow. Second operand 6 states and 519 transitions. [2024-11-19 09:43:09,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 715 flow [2024-11-19 09:43:09,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 137 transitions, 671 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:43:09,186 INFO L231 Difference]: Finished difference. Result has 144 places, 127 transitions, 521 flow [2024-11-19 09:43:09,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=521, PETRI_PLACES=144, PETRI_TRANSITIONS=127} [2024-11-19 09:43:09,187 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2024-11-19 09:43:09,187 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 127 transitions, 521 flow [2024-11-19 09:43:09,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:09,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:09,188 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:43:09,198 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-11-19 09:43:09,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:43:09,389 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:43:09,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:09,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1719973357, now seen corresponding path program 1 times [2024-11-19 09:43:09,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:09,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316749719] [2024-11-19 09:43:09,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:43:09,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:43:09,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:09,391 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:43:09,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 09:43:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:43:10,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-19 09:43:10,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:10,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:43:10,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:43:10,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:43:10,538 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 1 [2024-11-19 09:43:10,599 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2024-11-19 09:43:10,600 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 24 treesize of output 26 [2024-11-19 09:43:10,614 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 18 treesize of output 13 [2024-11-19 09:43:10,658 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-11-19 09:43:10,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-19 09:43:10,718 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-11-19 09:43:10,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-19 09:43:10,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-19 09:43:10,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 09:43:10,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 09:43:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:43:10,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:43:10,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_578 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_578) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-19 09:43:10,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_578 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_578) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-19 09:43:11,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:11,381 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 50 treesize of output 51 [2024-11-19 09:43:11,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:11,396 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 42 treesize of output 43 [2024-11-19 09:43:11,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:11,427 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 78 treesize of output 81 [2024-11-19 09:43:11,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:11,476 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 124 treesize of output 118 [2024-11-19 09:43:11,500 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 28 treesize of output 21 [2024-11-19 09:43:11,515 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 21 treesize of output 14 [2024-11-19 09:43:12,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:12,290 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 47 treesize of output 40 [2024-11-19 09:43:12,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:12,314 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 64 treesize of output 58 [2024-11-19 09:43:12,326 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 25 treesize of output 11 [2024-11-19 09:43:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 09:43:15,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:15,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316749719] [2024-11-19 09:43:15,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316749719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:43:15,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:43:15,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-11-19 09:43:15,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792195560] [2024-11-19 09:43:15,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:43:15,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 09:43:15,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:15,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 09:43:15,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=5, NotChecked=54, Total=272 [2024-11-19 09:43:15,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 133 [2024-11-19 09:43:15,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 127 transitions, 521 flow. Second operand has 17 states, 17 states have (on average 22.235294117647058) internal successors, (378), 17 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:15,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:15,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 133 [2024-11-19 09:43:15,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:21,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 09:43:25,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 09:43:27,804 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_578 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_578) |c_~#c~0.base|) .cse0)))) (or (let ((.cse1 (bvadd (_ bv12 32) |c_ULTIMATE.start_new_~p~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (or (forall ((v_ArrVal_572 (_ BitVec 32))) (bvule .cse1 (select (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_572) |c_ULTIMATE.start_new_~p~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|))))) (or (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|)))) (bvule (bvadd (_ bv8 32) |c_ULTIMATE.start_new_~p~0#1.offset|) .cse1)) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (or (forall ((v_ArrVal_572 (_ BitVec 32))) (let ((.cse2 (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_572))) (or (bvule .cse1 (select .cse2 |c_ULTIMATE.start_new_~p~0#1.base|)) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) v_arrayElimCell_37) (select .cse2 v_arrayElimCell_36)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|))))))) (forall ((|~#c~0.base| (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |~#c~0.base|)))))) (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-19 09:43:32,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 09:43:33,855 INFO L124 PetriNetUnfolderBase]: 465/1264 cut-off events. [2024-11-19 09:43:33,855 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-11-19 09:43:33,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 1264 events. 465/1264 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7516 event pairs, 422 based on Foata normal form. 6/843 useless extension candidates. Maximal degree in co-relation 2384. Up to 951 conditions per place. [2024-11-19 09:43:33,862 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 92 selfloop transitions, 29 changer transitions 0/141 dead transitions. [2024-11-19 09:43:33,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 141 transitions, 817 flow [2024-11-19 09:43:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 09:43:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-19 09:43:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 516 transitions. [2024-11-19 09:43:33,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.19398496240601504 [2024-11-19 09:43:33,866 INFO L175 Difference]: Start difference. First operand has 144 places, 127 transitions, 521 flow. Second operand 20 states and 516 transitions. [2024-11-19 09:43:33,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 141 transitions, 817 flow [2024-11-19 09:43:33,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 141 transitions, 793 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-11-19 09:43:33,871 INFO L231 Difference]: Finished difference. Result has 164 places, 133 transitions, 601 flow [2024-11-19 09:43:33,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=601, PETRI_PLACES=164, PETRI_TRANSITIONS=133} [2024-11-19 09:43:33,872 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 46 predicate places. [2024-11-19 09:43:33,873 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 133 transitions, 601 flow [2024-11-19 09:43:33,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 22.235294117647058) internal successors, (378), 17 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:33,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:33,874 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:43:33,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 09:43:34,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:43:34,074 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-19 09:43:34,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1719973358, now seen corresponding path program 1 times [2024-11-19 09:43:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:34,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303059226] [2024-11-19 09:43:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:43:34,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:43:34,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:34,077 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:43:34,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 09:43:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:43:35,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 09:43:35,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:35,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:43:35,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2024-11-19 09:43:35,170 INFO L349 Elim1Store]: treesize reduction 90, result has 31.3 percent of original size [2024-11-19 09:43:35,171 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 35 treesize of output 61 [2024-11-19 09:43:35,240 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 38 treesize of output 31 [2024-11-19 09:43:35,297 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 38 treesize of output 31 [2024-11-19 09:43:35,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-11-19 09:43:35,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 09:43:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:43:35,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:43:39,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:39,724 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 30 treesize of output 31 [2024-11-19 09:43:39,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:39,738 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 54 treesize of output 57 [2024-11-19 09:43:39,746 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 21 treesize of output 14 [2024-11-19 09:43:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:43:41,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:41,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303059226] [2024-11-19 09:43:41,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303059226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:43:41,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:43:41,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-19 09:43:41,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629253206] [2024-11-19 09:43:41,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:43:41,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:43:41,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:41,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:43:41,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=177, Unknown=21, NotChecked=0, Total=240 [2024-11-19 09:43:45,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 09:43:50,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 09:43:55,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 09:44:00,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]