./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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-deref.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 dda5467f7679a243042daf02aae11f74f39b907c2525dfc042cb8ad8b69dcfc9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:44:17,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:44:17,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:44:17,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:44:17,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:44:17,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:44:17,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:44:17,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:44:17,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:44:17,450 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:44:17,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:44:17,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:44:17,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:44:17,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:44:17,452 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:44:17,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:44:17,453 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:44:17,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:44:17,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:44:17,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:44:17,454 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:44:17,455 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:44:17,455 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:44:17,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:44:17,455 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:44:17,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:44:17,456 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:44:17,456 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:44:17,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:44:17,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:44:17,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:44:17,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:44:17,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:44:17,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:44:17,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:44:17,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:44:17,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:44:17,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:44:17,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:44:17,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:44:17,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:44:17,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:44:17,462 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 -> dda5467f7679a243042daf02aae11f74f39b907c2525dfc042cb8ad8b69dcfc9 [2024-11-09 10:44:17,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:44:17,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:44:17,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:44:17,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:44:17,765 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:44:17,766 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-deref.i [2024-11-09 10:44:19,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:44:19,636 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:44:19,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing-deref.i [2024-11-09 10:44:19,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32604fba5/594d55719a3e4997925b3f2596731aac/FLAG7eec3ecae [2024-11-09 10:44:19,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32604fba5/594d55719a3e4997925b3f2596731aac [2024-11-09 10:44:19,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:44:19,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:44:19,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:44:19,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:44:19,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:44:19,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:19" (1/1) ... [2024-11-09 10:44:19,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756f4c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:19, skipping insertion in model container [2024-11-09 10:44:19,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:19" (1/1) ... [2024-11-09 10:44:19,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:44:20,202 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:20,202 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:20,203 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:20,203 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:20,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:44:20,302 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-09 10:44:20,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5b823096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:20, skipping insertion in model container [2024-11-09 10:44:20,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:44:20,304 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:44:20,306 INFO L158 Benchmark]: Toolchain (without parser) took 623.05ms. Allocated memory is still 144.7MB. Free memory was 86.9MB in the beginning and 66.9MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 10:44:20,306 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 144.7MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:44:20,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.46ms. Allocated memory is still 144.7MB. Free memory was 86.5MB in the beginning and 66.9MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 10:44:20,308 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 144.7MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 620.46ms. Allocated memory is still 144.7MB. Free memory was 86.5MB in the beginning and 66.9MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. 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-deref.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 dda5467f7679a243042daf02aae11f74f39b907c2525dfc042cb8ad8b69dcfc9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:44:22,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:44:22,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:44:22,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:44:22,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:44:22,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:44:22,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:44:22,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:44:22,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:44:22,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:44:22,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:44:22,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:44:22,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:44:22,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:44:22,548 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:44:22,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:44:22,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:44:22,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:44:22,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:44:22,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:44:22,554 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:44:22,554 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:44:22,554 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:44:22,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:44:22,555 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:44:22,555 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:44:22,555 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:44:22,555 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:44:22,555 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:44:22,556 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:44:22,556 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:44:22,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:44:22,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:44:22,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:44:22,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:44:22,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:44:22,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:44:22,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:44:22,565 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:44:22,566 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:44:22,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:44:22,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:44:22,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:44:22,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:44:22,568 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 -> dda5467f7679a243042daf02aae11f74f39b907c2525dfc042cb8ad8b69dcfc9 [2024-11-09 10:44:22,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:44:22,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:44:22,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:44:22,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:44:22,958 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:44:22,959 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-deref.i [2024-11-09 10:44:24,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:44:24,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:44:24,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing-deref.i [2024-11-09 10:44:24,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59f327ab/3eae31ee429c4c2a8ad6834ec9f11fd7/FLAG4009e6456 [2024-11-09 10:44:24,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59f327ab/3eae31ee429c4c2a8ad6834ec9f11fd7 [2024-11-09 10:44:24,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:44:24,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:44:24,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:44:24,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:44:24,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:44:24,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:24" (1/1) ... [2024-11-09 10:44:24,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755cd8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:24, skipping insertion in model container [2024-11-09 10:44:24,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:24" (1/1) ... [2024-11-09 10:44:24,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:44:25,431 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:25,432 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:25,432 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:25,433 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:25,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:44:25,510 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:44:25,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:44:25,573 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:25,573 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:25,574 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:25,574 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:25,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:44:25,619 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:44:25,657 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:25,658 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:25,658 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:25,659 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:25,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:44:25,772 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:44:25,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25 WrapperNode [2024-11-09 10:44:25,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:44:25,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:44:25,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:44:25,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:44:25,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,842 INFO L138 Inliner]: procedures = 284, calls = 126, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 303 [2024-11-09 10:44:25,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:44:25,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:44:25,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:44:25,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:44:25,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,893 INFO L175 MemorySlicer]: Split 100 memory accesses to 4 slices as follows [2, 5, 2, 91]. 91 percent of accesses are in the largest equivalence class. The 77 initializations are split as follows [2, 5, 0, 70]. The 13 writes are split as follows [0, 0, 1, 12]. [2024-11-09 10:44:25,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:44:25,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:44:25,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:44:25,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:44:25,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:44:25,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:44:25,989 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-09 10:44:25,991 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-09 10:44:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:44:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:44:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:44:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 10:44:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:44:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:44:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:44:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:44:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 10:44:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:44:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:44:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:44:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:44:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 10:44:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 10:44:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 10:44:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 10:44:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-09 10:44:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:44:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:44:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:44:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 10:44:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 10:44:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 10:44:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 10:44:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 10:44:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:44:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:44:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:44:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:44:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:44:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:44:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:44:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 10:44:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 10:44:26,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 10:44:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:44:26,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:44:26,038 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:44:26,271 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:44:26,273 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:44:27,193 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:44:27,194 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:44:28,811 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:44:28,812 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-09 10:44:28,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:44:28 BoogieIcfgContainer [2024-11-09 10:44:28,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:44:28,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:44:28,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:44:28,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:44:28,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:44:24" (1/3) ... [2024-11-09 10:44:28,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d27989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:44:28, skipping insertion in model container [2024-11-09 10:44:28,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25" (2/3) ... [2024-11-09 10:44:28,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d27989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:44:28, skipping insertion in model container [2024-11-09 10:44:28,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:44:28" (3/3) ... [2024-11-09 10:44:28,822 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing-deref.i [2024-11-09 10:44:28,841 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:44:28,841 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-11-09 10:44:28,841 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:44:28,945 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 10:44:28,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 133 transitions, 273 flow [2024-11-09 10:44:29,054 INFO L124 PetriNetUnfolderBase]: 18/145 cut-off events. [2024-11-09 10:44:29,055 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:44:29,059 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-09 10:44:29,059 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 133 transitions, 273 flow [2024-11-09 10:44:29,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 133 transitions, 273 flow [2024-11-09 10:44:29,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:44:29,086 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;@664c5a92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:44:29,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2024-11-09 10:44:29,104 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:44:29,104 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:44:29,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:44:29,104 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:29,105 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:44:29,105 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-09 10:44:29,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:29,111 INFO L85 PathProgramCache]: Analyzing trace with hash 832920, now seen corresponding path program 1 times [2024-11-09 10:44:29,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:29,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665337375] [2024-11-09 10:44:29,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:29,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-09 10:44:29,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:29,132 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-09 10:44:29,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:44:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:29,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:44:29,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:29,448 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-09 10:44:29,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:29,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:29,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665337375] [2024-11-09 10:44:29,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665337375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:29,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:29,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:29,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154593146] [2024-11-09 10:44:29,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:29,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:29,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:29,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:29,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:29,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 133 [2024-11-09 10:44:29,724 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-09 10:44:29,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:29,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 133 [2024-11-09 10:44:29,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:30,263 INFO L124 PetriNetUnfolderBase]: 125/490 cut-off events. [2024-11-09 10:44:30,264 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-09 10:44:30,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 490 events. 125/490 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2675 event pairs, 64 based on Foata normal form. 52/431 useless extension candidates. Maximal degree in co-relation 675. Up to 177 conditions per place. [2024-11-09 10:44:30,270 INFO L140 encePairwiseOnDemand]: 112/133 looper letters, 66 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2024-11-09 10:44:30,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 139 transitions, 425 flow [2024-11-09 10:44:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2024-11-09 10:44:30,287 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7048872180451128 [2024-11-09 10:44:30,289 INFO L175 Difference]: Start difference. First operand has 118 places, 133 transitions, 273 flow. Second operand 4 states and 375 transitions. [2024-11-09 10:44:30,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 139 transitions, 425 flow [2024-11-09 10:44:30,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 139 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:44:30,300 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 253 flow [2024-11-09 10:44:30,302 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-09 10:44:30,306 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2024-11-09 10:44:30,306 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 253 flow [2024-11-09 10:44:30,307 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-09 10:44:30,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:30,307 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:44:30,315 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-09 10:44:30,508 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-09 10:44:30,510 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-09 10:44:30,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:30,511 INFO L85 PathProgramCache]: Analyzing trace with hash 832921, now seen corresponding path program 1 times [2024-11-09 10:44:30,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:30,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126535916] [2024-11-09 10:44:30,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:30,512 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-09 10:44:30,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:30,516 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-09 10:44:30,517 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-09 10:44:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:30,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:44:30,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:30,751 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-09 10:44:30,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:30,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126535916] [2024-11-09 10:44:30,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126535916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:30,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:30,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:30,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474014528] [2024-11-09 10:44:30,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:30,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:30,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:30,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:30,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:30,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 133 [2024-11-09 10:44:30,981 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-09 10:44:30,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:30,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 133 [2024-11-09 10:44:30,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:31,395 INFO L124 PetriNetUnfolderBase]: 127/521 cut-off events. [2024-11-09 10:44:31,396 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2024-11-09 10:44:31,398 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-09 10:44:31,401 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 47 selfloop transitions, 5 changer transitions 0/120 dead transitions. [2024-11-09 10:44:31,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 371 flow [2024-11-09 10:44:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2024-11-09 10:44:31,404 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6447368421052632 [2024-11-09 10:44:31,404 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 253 flow. Second operand 4 states and 343 transitions. [2024-11-09 10:44:31,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 371 flow [2024-11-09 10:44:31,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 120 transitions, 359 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:31,408 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 286 flow [2024-11-09 10:44:31,409 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-09 10:44:31,410 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-09 10:44:31,410 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 286 flow [2024-11-09 10:44:31,410 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-09 10:44:31,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:31,411 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:44:31,417 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-09 10:44:31,614 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-09 10:44:31,615 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-09 10:44:31,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:31,616 INFO L85 PathProgramCache]: Analyzing trace with hash -955496144, now seen corresponding path program 1 times [2024-11-09 10:44:31,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:31,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119123078] [2024-11-09 10:44:31,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:31,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:44:31,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:31,621 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-09 10:44:31,622 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-09 10:44:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:31,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:44:31,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:31,832 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-09 10:44:31,839 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-09 10:44:31,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:31,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:31,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119123078] [2024-11-09 10:44:31,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119123078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:31,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:31,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393392908] [2024-11-09 10:44:31,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:31,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:44:31,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:31,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:44:31,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:44:31,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 133 [2024-11-09 10:44:31,951 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-09 10:44:31,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:31,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 133 [2024-11-09 10:44:31,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:32,243 INFO L124 PetriNetUnfolderBase]: 127/520 cut-off events. [2024-11-09 10:44:32,244 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-09 10:44:32,245 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-09 10:44:32,252 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 45 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2024-11-09 10:44:32,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 380 flow [2024-11-09 10:44:32,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:44:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:44:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-11-09 10:44:32,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766917293233082 [2024-11-09 10:44:32,255 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 286 flow. Second operand 3 states and 270 transitions. [2024-11-09 10:44:32,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 380 flow [2024-11-09 10:44:32,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:44:32,260 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 287 flow [2024-11-09 10:44:32,260 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-09 10:44:32,261 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-09 10:44:32,261 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 287 flow [2024-11-09 10:44:32,261 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-09 10:44:32,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:32,262 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:44:32,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:44:32,462 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-09 10:44:32,463 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-09 10:44:32,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash -955496143, now seen corresponding path program 1 times [2024-11-09 10:44:32,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:32,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883096466] [2024-11-09 10:44:32,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:32,465 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-09 10:44:32,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:32,468 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-09 10:44:32,490 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-09 10:44:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:32,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:44:32,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:32,655 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-09 10:44:32,666 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-09 10:44:32,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:32,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:32,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883096466] [2024-11-09 10:44:32,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883096466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:32,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:32,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:32,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287482902] [2024-11-09 10:44:32,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:32,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:44:32,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:32,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:44:32,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:44:32,829 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 133 [2024-11-09 10:44:32,830 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-09 10:44:32,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:32,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 133 [2024-11-09 10:44:32,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:33,074 INFO L124 PetriNetUnfolderBase]: 127/519 cut-off events. [2024-11-09 10:44:33,075 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-11-09 10:44:33,076 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-09 10:44:33,080 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 45 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2024-11-09 10:44:33,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 381 flow [2024-11-09 10:44:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:44:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:44:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-11-09 10:44:33,082 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766917293233082 [2024-11-09 10:44:33,082 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 287 flow. Second operand 3 states and 270 transitions. [2024-11-09 10:44:33,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 381 flow [2024-11-09 10:44:33,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:44:33,089 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 285 flow [2024-11-09 10:44:33,090 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-09 10:44:33,090 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2024-11-09 10:44:33,091 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 285 flow [2024-11-09 10:44:33,092 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-09 10:44:33,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:33,092 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:44:33,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 10:44:33,292 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-09 10:44:33,293 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-09 10:44:33,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash 444395612, now seen corresponding path program 1 times [2024-11-09 10:44:33,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:33,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709405349] [2024-11-09 10:44:33,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:33,294 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-09 10:44:33,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:33,298 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-09 10:44:33,299 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-09 10:44:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:33,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:44:33,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:33,455 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-09 10:44:33,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:33,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:33,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709405349] [2024-11-09 10:44:33,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709405349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:33,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:33,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:33,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023306740] [2024-11-09 10:44:33,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:33,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:44:33,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:33,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:44:33,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:44:33,458 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-09 10:44:33,458 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-09 10:44:33,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:33,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-09 10:44:33,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:33,723 INFO L124 PetriNetUnfolderBase]: 126/541 cut-off events. [2024-11-09 10:44:33,724 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-11-09 10:44:33,725 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-09 10:44:33,727 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 49 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2024-11-09 10:44:33,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 401 flow [2024-11-09 10:44:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:44:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:44:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-11-09 10:44:33,729 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6967418546365914 [2024-11-09 10:44:33,729 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 285 flow. Second operand 3 states and 278 transitions. [2024-11-09 10:44:33,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 401 flow [2024-11-09 10:44:33,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 122 transitions, 391 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:44:33,732 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 290 flow [2024-11-09 10:44:33,733 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-09 10:44:33,733 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-09 10:44:33,734 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 290 flow [2024-11-09 10:44:33,734 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-09 10:44:33,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:33,734 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:33,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 10:44:33,938 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-09 10:44:33,939 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-09 10:44:33,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:33,940 INFO L85 PathProgramCache]: Analyzing trace with hash 444391471, now seen corresponding path program 1 times [2024-11-09 10:44:33,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:33,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724728510] [2024-11-09 10:44:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:33,941 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-09 10:44:33,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:33,946 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-09 10:44:33,948 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-09 10:44:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:34,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:44:34,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:34,136 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-09 10:44:34,164 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-09 10:44:34,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:34,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:34,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724728510] [2024-11-09 10:44:34,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724728510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:34,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:34,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:34,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442028262] [2024-11-09 10:44:34,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:34,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:34,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:34,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:34,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:34,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-09 10:44:34,378 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-09 10:44:34,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:34,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-09 10:44:34,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:34,687 INFO L124 PetriNetUnfolderBase]: 126/537 cut-off events. [2024-11-09 10:44:34,688 INFO L125 PetriNetUnfolderBase]: For 33/34 co-relation queries the response was YES. [2024-11-09 10:44:34,689 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-09 10:44:34,691 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 46 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2024-11-09 10:44:34,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 116 transitions, 386 flow [2024-11-09 10:44:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2024-11-09 10:44:34,693 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6240601503759399 [2024-11-09 10:44:34,694 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 290 flow. Second operand 4 states and 332 transitions. [2024-11-09 10:44:34,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 116 transitions, 386 flow [2024-11-09 10:44:34,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:44:34,700 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 291 flow [2024-11-09 10:44:34,700 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-09 10:44:34,701 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-09 10:44:34,701 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 291 flow [2024-11-09 10:44:34,703 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-09 10:44:34,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:34,703 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:34,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 10:44:34,904 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-09 10:44:34,905 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-09 10:44:34,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:34,906 INFO L85 PathProgramCache]: Analyzing trace with hash 444391470, now seen corresponding path program 1 times [2024-11-09 10:44:34,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:34,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928213254] [2024-11-09 10:44:34,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:34,908 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-09 10:44:34,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:34,911 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-09 10:44:34,915 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-09 10:44:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:35,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:44:35,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:35,116 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-09 10:44:35,128 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-09 10:44:35,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:35,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:35,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928213254] [2024-11-09 10:44:35,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928213254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:35,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:35,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:35,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288708913] [2024-11-09 10:44:35,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:35,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:35,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:35,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:35,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:35,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 133 [2024-11-09 10:44:35,234 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-09 10:44:35,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:35,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 133 [2024-11-09 10:44:35,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:35,472 INFO L124 PetriNetUnfolderBase]: 126/533 cut-off events. [2024-11-09 10:44:35,472 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-11-09 10:44:35,473 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-09 10:44:35,475 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 43 selfloop transitions, 7 changer transitions 0/114 dead transitions. [2024-11-09 10:44:35,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 114 transitions, 387 flow [2024-11-09 10:44:35,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:44:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:44:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2024-11-09 10:44:35,478 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909774436090226 [2024-11-09 10:44:35,478 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 291 flow. Second operand 5 states and 393 transitions. [2024-11-09 10:44:35,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 114 transitions, 387 flow [2024-11-09 10:44:35,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 114 transitions, 379 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:35,481 INFO L231 Difference]: Finished difference. Result has 118 places, 114 transitions, 293 flow [2024-11-09 10:44:35,481 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-09 10:44:35,481 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2024-11-09 10:44:35,482 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 114 transitions, 293 flow [2024-11-09 10:44:35,482 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-09 10:44:35,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:35,482 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:35,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:44:35,682 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-09 10:44:35,683 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-09 10:44:35,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1858467739, now seen corresponding path program 1 times [2024-11-09 10:44:35,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:35,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104840349] [2024-11-09 10:44:35,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:35,684 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-09 10:44:35,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:35,685 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-09 10:44:35,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 10:44:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:36,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:44:36,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:36,327 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:44:36,327 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-09 10:44:36,384 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-09 10:44:36,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:36,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:36,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104840349] [2024-11-09 10:44:36,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104840349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:36,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:36,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:36,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944738708] [2024-11-09 10:44:36,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:36,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:36,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:36,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:36,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:36,547 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-09 10:44:36,547 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-09 10:44:36,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:36,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-09 10:44:36,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:36,890 INFO L124 PetriNetUnfolderBase]: 125/503 cut-off events. [2024-11-09 10:44:36,890 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2024-11-09 10:44:36,892 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-09 10:44:36,894 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 67 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2024-11-09 10:44:36,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 479 flow [2024-11-09 10:44:36,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2024-11-09 10:44:36,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6654135338345865 [2024-11-09 10:44:36,897 INFO L175 Difference]: Start difference. First operand has 118 places, 114 transitions, 293 flow. Second operand 4 states and 354 transitions. [2024-11-09 10:44:36,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 479 flow [2024-11-09 10:44:36,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 135 transitions, 465 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:44:36,900 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 285 flow [2024-11-09 10:44:36,901 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-09 10:44:36,901 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2024-11-09 10:44:36,902 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 285 flow [2024-11-09 10:44:36,902 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-09 10:44:36,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:36,902 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:36,909 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-09 10:44:37,103 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-09 10:44:37,103 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-09 10:44:37,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1858467740, now seen corresponding path program 1 times [2024-11-09 10:44:37,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:37,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660144631] [2024-11-09 10:44:37,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:37,105 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-09 10:44:37,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:37,106 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-09 10:44:37,108 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-09 10:44:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:37,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:44:37,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:37,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:44:37,737 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-09 10:44:37,804 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-09 10:44:37,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:37,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:37,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660144631] [2024-11-09 10:44:37,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660144631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:37,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:37,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:37,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45790749] [2024-11-09 10:44:37,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:37,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:44:37,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:37,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:44:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:44:38,072 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-09 10:44:38,073 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-09 10:44:38,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:38,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-09 10:44:38,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:38,430 INFO L124 PetriNetUnfolderBase]: 128/561 cut-off events. [2024-11-09 10:44:38,430 INFO L125 PetriNetUnfolderBase]: For 52/53 co-relation queries the response was YES. [2024-11-09 10:44:38,432 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-09 10:44:38,434 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 53 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2024-11-09 10:44:38,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 119 transitions, 431 flow [2024-11-09 10:44:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2024-11-09 10:44:38,436 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6409774436090225 [2024-11-09 10:44:38,437 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 285 flow. Second operand 4 states and 341 transitions. [2024-11-09 10:44:38,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 119 transitions, 431 flow [2024-11-09 10:44:38,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 119 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:38,440 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 321 flow [2024-11-09 10:44:38,440 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-09 10:44:38,441 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2024-11-09 10:44:38,441 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 321 flow [2024-11-09 10:44:38,441 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-09 10:44:38,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:38,442 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:38,453 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-09 10:44:38,645 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-09 10:44:38,646 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-09 10:44:38,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:38,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1777925979, now seen corresponding path program 1 times [2024-11-09 10:44:38,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:38,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925584746] [2024-11-09 10:44:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:38,647 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-09 10:44:38,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:38,648 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-09 10:44:38,649 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-09 10:44:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:39,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 10:44:39,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:39,377 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-09 10:44:39,387 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-09 10:44:39,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 10:44:39,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 10:44:39,543 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 10:44:39,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 10:44:39,568 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:44:39,568 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-09 10:44:39,631 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-09 10:44:39,639 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-09 10:44:39,700 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-09 10:44:39,708 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-09 10:44:39,756 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-09 10:44:39,765 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-09 10:44:39,818 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-09 10:44:39,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:39,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:39,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925584746] [2024-11-09 10:44:39,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925584746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:39,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:39,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:44:39,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783766200] [2024-11-09 10:44:39,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:39,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:44:39,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:39,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:44:39,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:44:40,999 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 133 [2024-11-09 10:44:41,000 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-09 10:44:41,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:41,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 133 [2024-11-09 10:44:41,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:41,664 INFO L124 PetriNetUnfolderBase]: 128/560 cut-off events. [2024-11-09 10:44:41,664 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2024-11-09 10:44:41,666 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-09 10:44:41,668 INFO L140 encePairwiseOnDemand]: 122/133 looper letters, 69 selfloop transitions, 10 changer transitions 0/132 dead transitions. [2024-11-09 10:44:41,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 132 transitions, 517 flow [2024-11-09 10:44:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:44:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:44:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 639 transitions. [2024-11-09 10:44:41,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48045112781954885 [2024-11-09 10:44:41,670 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 321 flow. Second operand 10 states and 639 transitions. [2024-11-09 10:44:41,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 132 transitions, 517 flow [2024-11-09 10:44:41,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 132 transitions, 515 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:44:41,673 INFO L231 Difference]: Finished difference. Result has 130 places, 120 transitions, 371 flow [2024-11-09 10:44:41,674 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=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=371, PETRI_PLACES=130, PETRI_TRANSITIONS=120} [2024-11-09 10:44:41,674 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 12 predicate places. [2024-11-09 10:44:41,674 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 120 transitions, 371 flow [2024-11-09 10:44:41,675 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-09 10:44:41,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:41,675 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:41,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 10:44:41,876 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-09 10:44:41,876 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-09 10:44:41,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1777925978, now seen corresponding path program 1 times [2024-11-09 10:44:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:41,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140641510] [2024-11-09 10:44:41,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:41,877 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-09 10:44:41,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:41,880 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-09 10:44:41,881 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-09 10:44:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:42,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 10:44:42,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:42,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 10:44:42,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2024-11-09 10:44:42,766 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-09 10:44:42,767 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-09 10:44:42,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 10:44:42,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 10:44:42,869 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-09 10:44:42,913 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-09 10:44:42,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:42,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:42,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140641510] [2024-11-09 10:44:42,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140641510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:42,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:42,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:44:42,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582706564] [2024-11-09 10:44:42,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:42,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:44:42,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:42,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:44:42,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:44:43,862 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 133 [2024-11-09 10:44:43,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 120 transitions, 371 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-09 10:44:43,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:43,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 133 [2024-11-09 10:44:43,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:44,718 INFO L124 PetriNetUnfolderBase]: 126/530 cut-off events. [2024-11-09 10:44:44,718 INFO L125 PetriNetUnfolderBase]: For 37/38 co-relation queries the response was YES. [2024-11-09 10:44:44,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 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 2880 event pairs, 64 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 874. Up to 192 conditions per place. [2024-11-09 10:44:44,723 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 75 selfloop transitions, 19 changer transitions 0/151 dead transitions. [2024-11-09 10:44:44,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 151 transitions, 629 flow [2024-11-09 10:44:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:44:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:44:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 766 transitions. [2024-11-09 10:44:44,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5235816814764184 [2024-11-09 10:44:44,726 INFO L175 Difference]: Start difference. First operand has 130 places, 120 transitions, 371 flow. Second operand 11 states and 766 transitions. [2024-11-09 10:44:44,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 151 transitions, 629 flow [2024-11-09 10:44:44,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 151 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:44:44,730 INFO L231 Difference]: Finished difference. Result has 143 places, 125 transitions, 454 flow [2024-11-09 10:44:44,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=454, PETRI_PLACES=143, PETRI_TRANSITIONS=125} [2024-11-09 10:44:44,732 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2024-11-09 10:44:44,732 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 125 transitions, 454 flow [2024-11-09 10:44:44,733 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-09 10:44:44,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:44,734 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:44,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 10:44:44,934 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-09 10:44:44,934 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:44,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:44,935 INFO L85 PathProgramCache]: Analyzing trace with hash -718868726, now seen corresponding path program 1 times [2024-11-09 10:44:44,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:44,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693714970] [2024-11-09 10:44:44,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:44,936 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-09 10:44:44,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:44,937 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-09 10:44:44,938 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-09 10:44:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:45,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:44:45,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:45,176 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-09 10:44:45,195 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-09 10:44:45,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:45,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:45,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693714970] [2024-11-09 10:44:45,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693714970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:45,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:45,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:45,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349217207] [2024-11-09 10:44:45,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:45,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:45,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:45,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:45,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-09 10:44:45,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 125 transitions, 454 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-09 10:44:45,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:45,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-09 10:44:45,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:45,510 INFO L124 PetriNetUnfolderBase]: 127/548 cut-off events. [2024-11-09 10:44:45,510 INFO L125 PetriNetUnfolderBase]: For 106/107 co-relation queries the response was YES. [2024-11-09 10:44:45,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 548 events. 127/548 cut-off events. For 106/107 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2953 event pairs, 105 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 931. Up to 271 conditions per place. [2024-11-09 10:44:45,513 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 50 selfloop transitions, 11 changer transitions 0/123 dead transitions. [2024-11-09 10:44:45,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 123 transitions, 572 flow [2024-11-09 10:44:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2024-11-09 10:44:45,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6240601503759399 [2024-11-09 10:44:45,514 INFO L175 Difference]: Start difference. First operand has 143 places, 125 transitions, 454 flow. Second operand 4 states and 332 transitions. [2024-11-09 10:44:45,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 123 transitions, 572 flow [2024-11-09 10:44:45,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 123 transitions, 548 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-09 10:44:45,519 INFO L231 Difference]: Finished difference. Result has 139 places, 123 transitions, 448 flow [2024-11-09 10:44:45,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=448, PETRI_PLACES=139, PETRI_TRANSITIONS=123} [2024-11-09 10:44:45,520 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 21 predicate places. [2024-11-09 10:44:45,520 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 123 transitions, 448 flow [2024-11-09 10:44:45,520 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-09 10:44:45,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:45,520 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:45,527 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-09 10:44:45,724 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-09 10:44:45,725 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:45,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash -718868725, now seen corresponding path program 1 times [2024-11-09 10:44:45,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:45,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661726002] [2024-11-09 10:44:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:45,726 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-09 10:44:45,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:45,727 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-09 10:44:45,728 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-09 10:44:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:45,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:44:45,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:45,918 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-09 10:44:45,952 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-09 10:44:45,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:45,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661726002] [2024-11-09 10:44:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661726002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:45,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:45,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563650779] [2024-11-09 10:44:45,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:45,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:45,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:45,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:46,078 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 133 [2024-11-09 10:44:46,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 123 transitions, 448 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-09 10:44:46,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:46,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 133 [2024-11-09 10:44:46,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:46,349 INFO L124 PetriNetUnfolderBase]: 127/540 cut-off events. [2024-11-09 10:44:46,349 INFO L125 PetriNetUnfolderBase]: For 130/131 co-relation queries the response was YES. [2024-11-09 10:44:46,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 540 events. 127/540 cut-off events. For 130/131 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2903 event pairs, 105 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 896. Up to 271 conditions per place. [2024-11-09 10:44:46,353 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 48 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2024-11-09 10:44:46,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 121 transitions, 562 flow [2024-11-09 10:44:46,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 338 transitions. [2024-11-09 10:44:46,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6353383458646616 [2024-11-09 10:44:46,356 INFO L175 Difference]: Start difference. First operand has 139 places, 123 transitions, 448 flow. Second operand 4 states and 338 transitions. [2024-11-09 10:44:46,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 121 transitions, 562 flow [2024-11-09 10:44:46,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 121 transitions, 540 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:46,361 INFO L231 Difference]: Finished difference. Result has 137 places, 121 transitions, 444 flow [2024-11-09 10:44:46,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=444, PETRI_PLACES=137, PETRI_TRANSITIONS=121} [2024-11-09 10:44:46,362 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 19 predicate places. [2024-11-09 10:44:46,362 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 121 transitions, 444 flow [2024-11-09 10:44:46,363 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-09 10:44:46,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:46,363 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:46,371 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 (14)] Ended with exit code 0 [2024-11-09 10:44:46,563 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-09 10:44:46,564 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-09 10:44:46,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1991896648, now seen corresponding path program 1 times [2024-11-09 10:44:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:46,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568813572] [2024-11-09 10:44:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:46,565 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-09 10:44:46,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:46,566 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-09 10:44:46,567 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-09 10:44:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:46,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:44:46,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:46,828 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-09 10:44:46,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:44:46,859 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-09 10:44:46,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:46,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568813572] [2024-11-09 10:44:46,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568813572] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:44:46,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:44:46,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 10:44:46,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558577776] [2024-11-09 10:44:46,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:44:46,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:44:46,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:46,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:44:46,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:44:46,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-09 10:44:46,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 121 transitions, 444 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-09 10:44:46,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:46,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-09 10:44:46,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:47,270 INFO L124 PetriNetUnfolderBase]: 127/590 cut-off events. [2024-11-09 10:44:47,271 INFO L125 PetriNetUnfolderBase]: For 206/207 co-relation queries the response was YES. [2024-11-09 10:44:47,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 590 events. 127/590 cut-off events. For 206/207 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3015 event pairs, 105 based on Foata normal form. 6/488 useless extension candidates. Maximal degree in co-relation 1028. Up to 267 conditions per place. [2024-11-09 10:44:47,274 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 63 selfloop transitions, 11 changer transitions 0/136 dead transitions. [2024-11-09 10:44:47,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 136 transitions, 704 flow [2024-11-09 10:44:47,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:44:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:44:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2024-11-09 10:44:47,277 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.650375939849624 [2024-11-09 10:44:47,277 INFO L175 Difference]: Start difference. First operand has 137 places, 121 transitions, 444 flow. Second operand 6 states and 519 transitions. [2024-11-09 10:44:47,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 136 transitions, 704 flow [2024-11-09 10:44:47,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 136 transitions, 660 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:47,281 INFO L231 Difference]: Finished difference. Result has 143 places, 126 transitions, 510 flow [2024-11-09 10:44:47,282 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=143, PETRI_TRANSITIONS=126} [2024-11-09 10:44:47,282 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2024-11-09 10:44:47,282 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 126 transitions, 510 flow [2024-11-09 10:44:47,283 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-09 10:44:47,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:47,283 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:47,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 10:44:47,483 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-09 10:44:47,484 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-09 10:44:47,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1447423873, now seen corresponding path program 1 times [2024-11-09 10:44:47,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:47,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340631416] [2024-11-09 10:44:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:47,485 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-09 10:44:47,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:47,486 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-09 10:44:47,487 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-09 10:44:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:48,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 10:44:48,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:48,336 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-09 10:44:48,340 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-09 10:44:48,560 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 19 treesize of output 1 [2024-11-09 10:44:48,566 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 13 treesize of output 9 [2024-11-09 10:44:48,616 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-09 10:44:48,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2024-11-09 10:44:48,655 INFO L349 Elim1Store]: treesize reduction 28, result has 34.9 percent of original size [2024-11-09 10:44:48,656 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 26 treesize of output 28 [2024-11-09 10:44:48,710 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 30 treesize of output 23 [2024-11-09 10:44:48,722 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 18 treesize of output 13 [2024-11-09 10:44:48,762 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 30 treesize of output 23 [2024-11-09 10:44:48,774 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 18 treesize of output 13 [2024-11-09 10:44:48,799 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 30 treesize of output 23 [2024-11-09 10:44:48,806 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 18 treesize of output 13 [2024-11-09 10:44:48,850 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 21 treesize of output 9 [2024-11-09 10:44:48,866 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-09 10:44:48,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:44:48,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_580) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (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_580) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_581) |c_~#c~0.base|) .cse1)))))) is different from false [2024-11-09 10:44:48,995 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (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_580) |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_581) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_580 (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_580) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-09 10:44:49,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:49,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 38 [2024-11-09 10:44:49,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:49,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 55 [2024-11-09 10:44:49,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 10:44:49,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:49,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2024-11-09 10:44:49,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:49,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2024-11-09 10:44:49,326 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:44:49,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:49,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2024-11-09 10:44:49,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:44:49,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:49,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2024-11-09 10:44:50,602 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-09 10:44:50,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340631416] [2024-11-09 10:44:50,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340631416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:44:50,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:44:50,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-11-09 10:44:50,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980749371] [2024-11-09 10:44:50,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:44:50,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:44:50,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:50,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:44:50,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=175, Unknown=2, NotChecked=54, Total=272 [2024-11-09 10:44:51,091 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 133 [2024-11-09 10:44:51,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 126 transitions, 510 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-09 10:44:51,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:51,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 133 [2024-11-09 10:44:51,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:53,848 INFO L124 PetriNetUnfolderBase]: 465/1264 cut-off events. [2024-11-09 10:44:53,848 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-11-09 10:44:53,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2553 conditions, 1264 events. 465/1264 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7514 event pairs, 422 based on Foata normal form. 6/837 useless extension candidates. Maximal degree in co-relation 2461. Up to 954 conditions per place. [2024-11-09 10:44:53,859 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 88 selfloop transitions, 23 changer transitions 0/131 dead transitions. [2024-11-09 10:44:53,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 131 transitions, 746 flow [2024-11-09 10:44:53,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:44:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:44:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 336 transitions. [2024-11-09 10:44:53,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.21052631578947367 [2024-11-09 10:44:53,862 INFO L175 Difference]: Start difference. First operand has 143 places, 126 transitions, 510 flow. Second operand 12 states and 336 transitions. [2024-11-09 10:44:53,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 131 transitions, 746 flow [2024-11-09 10:44:53,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 131 transitions, 728 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-09 10:44:53,867 INFO L231 Difference]: Finished difference. Result has 154 places, 127 transitions, 546 flow [2024-11-09 10:44:53,867 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=546, PETRI_PLACES=154, PETRI_TRANSITIONS=127} [2024-11-09 10:44:53,868 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 36 predicate places. [2024-11-09 10:44:53,868 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 127 transitions, 546 flow [2024-11-09 10:44:53,868 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-09 10:44:53,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:53,868 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:53,879 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 (16)] Forceful destruction successful, exit code 0 [2024-11-09 10:44:54,069 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-09 10:44:54,069 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-09 10:44:54,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1447423874, now seen corresponding path program 1 times [2024-11-09 10:44:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:54,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067068511] [2024-11-09 10:44:54,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:54,070 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-09 10:44:54,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:54,071 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-09 10:44:54,072 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-09 10:44:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:54,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 10:44:54,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:54,899 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-09 10:44:54,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-09 10:44:55,062 INFO L349 Elim1Store]: treesize reduction 86, result has 31.2 percent of original size [2024-11-09 10:44:55,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 59 [2024-11-09 10:44:55,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-09 10:44:55,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-09 10:44:55,204 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-09 10:44:55,272 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-09 10:44:55,331 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-09 10:44:55,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:44:55,375 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_683) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-11-09 10:45:03,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:45:03,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-09 10:45:03,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:45:03,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2024-11-09 10:45:03,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-09 10:45:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 10:45:04,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:45:04,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067068511] [2024-11-09 10:45:04,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067068511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:45:04,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:45:04,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-09 10:45:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245907035] [2024-11-09 10:45:04,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:45:04,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:45:04,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:45:04,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:45:04,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=157, Unknown=16, NotChecked=26, Total=240 [2024-11-09 10:45:05,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 133 [2024-11-09 10:45:05,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 127 transitions, 546 flow. Second operand has 16 states, 16 states have (on average 32.125) internal successors, (514), 16 states have internal predecessors, (514), 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-09 10:45:05,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:45:05,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 133 [2024-11-09 10:45:05,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:45:07,600 INFO L124 PetriNetUnfolderBase]: 329/1030 cut-off events. [2024-11-09 10:45:07,600 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2024-11-09 10:45:07,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 1030 events. 329/1030 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6067 event pairs, 292 based on Foata normal form. 0/799 useless extension candidates. Maximal degree in co-relation 1975. Up to 679 conditions per place. [2024-11-09 10:45:07,605 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 78 selfloop transitions, 22 changer transitions 0/130 dead transitions. [2024-11-09 10:45:07,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 130 transitions, 754 flow [2024-11-09 10:45:07,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:45:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:45:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 415 transitions. [2024-11-09 10:45:07,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2836637047163363 [2024-11-09 10:45:07,609 INFO L175 Difference]: Start difference. First operand has 154 places, 127 transitions, 546 flow. Second operand 11 states and 415 transitions. [2024-11-09 10:45:07,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 130 transitions, 754 flow [2024-11-09 10:45:07,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 130 transitions, 671 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-09 10:45:07,614 INFO L231 Difference]: Finished difference. Result has 150 places, 126 transitions, 503 flow [2024-11-09 10:45:07,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=503, PETRI_PLACES=150, PETRI_TRANSITIONS=126} [2024-11-09 10:45:07,616 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 32 predicate places. [2024-11-09 10:45:07,617 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 126 transitions, 503 flow [2024-11-09 10:45:07,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 32.125) internal successors, (514), 16 states have internal predecessors, (514), 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-09 10:45:07,617 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:45:07,617 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:45:07,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-09 10:45:07,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:45:07,818 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:45:07,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:45:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1784832204, now seen corresponding path program 1 times [2024-11-09 10:45:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:45:07,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093566222] [2024-11-09 10:45:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:45:07,819 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-09 10:45:07,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:45:07,821 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:45:07,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 10:45:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:45:08,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:45:08,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:45:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:45:08,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:45:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:45:08,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:45:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093566222] [2024-11-09 10:45:08,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093566222] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:45:08,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:45:08,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 10:45:08,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332036600] [2024-11-09 10:45:08,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:45:08,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:45:08,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:45:08,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:45:08,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:45:08,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-09 10:45:08,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 126 transitions, 503 flow. Second operand has 12 states, 12 states have (on average 79.91666666666667) internal successors, (959), 12 states have internal predecessors, (959), 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-09 10:45:08,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:45:08,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-09 10:45:08,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:45:09,579 INFO L124 PetriNetUnfolderBase]: 127/698 cut-off events. [2024-11-09 10:45:09,580 INFO L125 PetriNetUnfolderBase]: For 492/493 co-relation queries the response was YES. [2024-11-09 10:45:09,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 698 events. 127/698 cut-off events. For 492/493 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2989 event pairs, 105 based on Foata normal form. 12/608 useless extension candidates. Maximal degree in co-relation 1467. Up to 267 conditions per place. [2024-11-09 10:45:09,584 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 93 selfloop transitions, 23 changer transitions 0/178 dead transitions. [2024-11-09 10:45:09,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 178 transitions, 1179 flow [2024-11-09 10:45:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:45:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:45:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1008 transitions. [2024-11-09 10:45:09,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2024-11-09 10:45:09,591 INFO L175 Difference]: Start difference. First operand has 150 places, 126 transitions, 503 flow. Second operand 12 states and 1008 transitions. [2024-11-09 10:45:09,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 178 transitions, 1179 flow [2024-11-09 10:45:09,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 178 transitions, 1036 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-11-09 10:45:09,597 INFO L231 Difference]: Finished difference. Result has 158 places, 139 transitions, 684 flow [2024-11-09 10:45:09,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=684, PETRI_PLACES=158, PETRI_TRANSITIONS=139} [2024-11-09 10:45:09,598 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 40 predicate places. [2024-11-09 10:45:09,598 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 139 transitions, 684 flow [2024-11-09 10:45:09,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 79.91666666666667) internal successors, (959), 12 states have internal predecessors, (959), 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-09 10:45:09,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:45:09,599 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:45:09,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-09 10:45:09,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:45:09,800 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:45:09,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:45:09,800 INFO L85 PathProgramCache]: Analyzing trace with hash -470739532, now seen corresponding path program 2 times [2024-11-09 10:45:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:45:09,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391754378] [2024-11-09 10:45:09,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:45:09,801 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-09 10:45:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:45:09,803 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:45:09,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 10:45:11,960 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:45:11,960 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:45:12,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 1663 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:45:12,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:45:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2024-11-09 10:45:12,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:45:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2024-11-09 10:45:12,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:45:12,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391754378] [2024-11-09 10:45:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391754378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:45:12,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:45:12,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 10:45:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823480900] [2024-11-09 10:45:12,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:45:12,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:45:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:45:12,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:45:12,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:45:12,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-09 10:45:12,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 139 transitions, 684 flow. Second operand has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 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-09 10:45:12,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:45:12,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-09 10:45:12,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:45:12,929 INFO L124 PetriNetUnfolderBase]: 129/935 cut-off events. [2024-11-09 10:45:12,929 INFO L125 PetriNetUnfolderBase]: For 923/924 co-relation queries the response was YES. [2024-11-09 10:45:12,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2207 conditions, 935 events. 129/935 cut-off events. For 923/924 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2715 event pairs, 105 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 2119. Up to 261 conditions per place. [2024-11-09 10:45:12,933 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 123 selfloop transitions, 6 changer transitions 0/191 dead transitions. [2024-11-09 10:45:12,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 191 transitions, 1410 flow [2024-11-09 10:45:12,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:45:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:45:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2024-11-09 10:45:12,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6616541353383458 [2024-11-09 10:45:12,934 INFO L175 Difference]: Start difference. First operand has 158 places, 139 transitions, 684 flow. Second operand 6 states and 528 transitions. [2024-11-09 10:45:12,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 191 transitions, 1410 flow [2024-11-09 10:45:12,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 191 transitions, 1386 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:45:12,942 INFO L231 Difference]: Finished difference. Result has 164 places, 142 transitions, 751 flow [2024-11-09 10:45:12,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=751, PETRI_PLACES=164, PETRI_TRANSITIONS=142} [2024-11-09 10:45:12,942 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 46 predicate places. [2024-11-09 10:45:12,942 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 142 transitions, 751 flow [2024-11-09 10:45:12,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 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-09 10:45:12,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:45:12,943 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-11-09 10:45:12,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-09 10:45:13,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:45:13,144 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:45:13,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:45:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash -470739492, now seen corresponding path program 2 times [2024-11-09 10:45:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:45:13,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915953140] [2024-11-09 10:45:13,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:45:13,145 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-09 10:45:13,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:45:13,146 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:45:13,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 10:45:15,453 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:45:15,453 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:45:15,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 1664 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:45:15,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:45:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:45:15,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:45:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:45:16,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:45:16,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915953140] [2024-11-09 10:45:16,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915953140] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:45:16,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:45:16,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-09 10:45:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948475704] [2024-11-09 10:45:16,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:45:16,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:45:16,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:45:16,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:45:16,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-11-09 10:45:16,083 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-09 10:45:16,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 142 transitions, 751 flow. Second operand has 24 states, 24 states have (on average 80.45833333333333) internal successors, (1931), 24 states have internal predecessors, (1931), 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-09 10:45:16,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:45:16,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-09 10:45:16,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:45:18,933 INFO L124 PetriNetUnfolderBase]: 129/1439 cut-off events. [2024-11-09 10:45:18,933 INFO L125 PetriNetUnfolderBase]: For 4077/4078 co-relation queries the response was YES. [2024-11-09 10:45:18,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3824 conditions, 1439 events. 129/1439 cut-off events. For 4077/4078 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2850 event pairs, 105 based on Foata normal form. 48/1386 useless extension candidates. Maximal degree in co-relation 3732. Up to 274 conditions per place. [2024-11-09 10:45:18,939 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 156 selfloop transitions, 47 changer transitions 0/265 dead transitions. [2024-11-09 10:45:18,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 265 transitions, 2121 flow [2024-11-09 10:45:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 10:45:18,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-09 10:45:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1986 transitions. [2024-11-09 10:45:18,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6221804511278195 [2024-11-09 10:45:18,942 INFO L175 Difference]: Start difference. First operand has 164 places, 142 transitions, 751 flow. Second operand 24 states and 1986 transitions. [2024-11-09 10:45:18,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 265 transitions, 2121 flow [2024-11-09 10:45:18,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 265 transitions, 2119 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:45:18,954 INFO L231 Difference]: Finished difference. Result has 199 places, 167 transitions, 1341 flow [2024-11-09 10:45:18,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1341, PETRI_PLACES=199, PETRI_TRANSITIONS=167} [2024-11-09 10:45:18,955 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 81 predicate places. [2024-11-09 10:45:18,955 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 167 transitions, 1341 flow [2024-11-09 10:45:18,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 80.45833333333333) internal successors, (1931), 24 states have internal predecessors, (1931), 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-09 10:45:18,956 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:45:18,956 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1] [2024-11-09 10:45:18,981 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 (20)] Ended with exit code 0 [2024-11-09 10:45:19,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 10:45:19,157 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:45:19,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:45:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1315070684, now seen corresponding path program 3 times [2024-11-09 10:45:19,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:45:19,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083955764] [2024-11-09 10:45:19,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:45:19,159 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-09 10:45:19,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:45:19,160 INFO L229 MonitoredProcess]: Starting monitored process 21 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-09 10:45:19,161 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 (21)] Waiting until timeout for monitored process